Utilities#
Helper Functions#
Miscellaneous Helpers for NetworkX.
These are not imported into the base networkx namespace but can be accessed, for example, as
>>> import networkx
>>> networkx.utils.make_list_of_ints({1, 2, 3})
[1, 2, 3]
>>> networkx.utils.arbitrary_element({5, 1, 7})
1
|
Returns an arbitrary element of |
|
Return flattened version of (possibly nested) iterable object. |
|
Return list of ints from sequence of integral numbers. |
|
Convert a dictionary of dictionaries to a numpy array with optional mapping. |
|
s -> (s0, s1), (s1, s2), (s2, s3), ... |
|
Converts a many-to-one mapping into a one-to-many mapping. |
|
Returns a numpy.random.RandomState or numpy.random.Generator instance depending on input. |
|
Returns a random.Random instance depending on input. |
|
Check if nodes are equal. |
|
Check if edges are equal. |
|
Check if graphs are equal. |
Data Structures and Algorithms#
Union-find data structure.
|
Find the sets containing the objects and merge them all. |
Random Sequence Generators#
Utilities for generating random numbers, random sequences, and random selections.
|
Return sample sequence of length n from a power law distribution. |
|
Returns normalized cumulative distribution from discrete distribution. |
|
Return sample sequence of length n from a given discrete distribution or discrete cumulative distribution. |
|
Returns a random value chosen from the Zipf distribution. |
|
Returns k items without replacement from a weighted sample. |
|
Returns a single element from a weighted sample. |
Decorators#
|
Decorator to ensure clean opening and closing of files. |
|
Decorator to mark algorithms as not implemented |
|
Decorator to allow number of nodes or container of nodes. |
|
Decorator to generate a |
|
Decorator to generate a random.Random instance (or equiv). |
|
A decorator to apply a map to arguments before calling the function |
Cuthill-Mckee Ordering#
Cuthill-McKee ordering of graph nodes to produce sparse matrices
|
Generate an ordering (permutation) of the graph nodes to make a sparse matrix. |
|
Generate an ordering (permutation) of the graph nodes to make a sparse matrix. |
Mapped Queue#
Priority queue class with updatable priorities.
|
The MappedQueue class implements a min-heap with removal and update-priority. |