connected_components_generator(graph: networkx.classes.graph.Graph) → Generator[networkx.classes.graph.Graph, None, None]¶
Returns a Generator that will provide each component as a networkx.Graph copy
largest_connected_component(graph: networkx.classes.graph.Graph, weakly: bool = True) → networkx.classes.graph.Graph¶
Returns the largest connected component of the graph.
A copy of the largest connected component as an nx.Graph object
- Return type
number_connected_components(graph: networkx.classes.graph.Graph) → int¶
Returns the number of connected components in the Graph.
This function calls the appropriate newtorkx connected components function depending on whether it is Undirected or Directed.
A PartitionedGraph combines a networkx graph object with a global community partitioning for that graph.
Alias for field number 1
Alias for field number 0
diagonal_augmentation(graph: Union[networkx.classes.graph.Graph, networkx.classes.digraph.DiGraph], weight_column: str = 'weight') → networkx.classes.graph.Graph¶
Replaces the diagonal of adjacency matrix of the graph with the weighted degree / number of vertices in graph. For directed graphs, the weighted in and out degree is averaged.
Modifies the provided graph in place as well as returning it.
The networkx graph which will get a replaced diagonal
weight_column (str) – The weight column of the edge
The networkx Graph or DiGraph object that was modified in place.
- Return type
- topologic.embedding package
- topologic.embedding.clustering package
- topologic.embedding.distance package
- topologic.embedding.metric package
- topologic.io package
- topologic.partition package
- topologic.projection package
- topologic.similarity package
- topologic.statistics package