faucetsdn / faucet / debian / buster / python-networkx-doc_2.5_all.deb

python-networkx-doc_2.5_all.deb

STEP 1: Have you installed this repository?

If not, run this installation script command:

curl -s https://packagecloud.io/install/repositories/faucetsdn/faucet/script.deb.sh | sudo bash

STEP 2: Install the package

sudo apt-get install python-networkx-doc=2.5

tool to create, manipulate and study complex networks - documentation

Full description:
  tool to create, manipulate and study complex networks - documentation
 NetworkX is a Python-based package for the creation, manipulation, and
 study of the structure, dynamics, and functions of complex networks.
 .
 The structure of a graph or network is encoded in the edges (connections,
 links, ties, arcs, bonds) between nodes (vertices, sites, actors). If
 unqualified, by graph it's meant a simple undirected graph, i.e. no
 self-loops and no multiple edges are allowed. By a network it's usually
 meant a graph with weights (fields, properties) on nodes and/or edges.
 .
 The potential audience for NetworkX includes: mathematicians, physicists,
 biologists, computer scientists, social scientists.
 .
 This package contains documentation for NetworkX.

Checksums

MD5	3dffefe255dfa00571888186ad3f5ee8
SHA1	cbfa4148bf8dd518029d4cc363ebbe0f853785ae
SHA256	191f5ca49225eb895f7eb0cc1b0c3229b7904f807e00e508ee3cebf1e31984d8
SHA512	9f583c201c34a9e0bc11d621558ae06cb7d343870e9e6dddc5c2b323b830ec19224ff5a8c0f55c6d19bcb1c4053a9f45b8c4983aab280819eb674e37091e7c77

Depends

libjs-mathjax, libjs-sphinxdoc (>= 2.4.3-5~), sphinx-rtd-theme-common (>= 0.5.1+dfsg)

Files

/usr/share/doc/python-networkx-doc/html/reference/algorithms/generated/networkx.algorithms.isomorphism.categorical_node_match.html
/usr/share/doc/python-networkx-doc/html/reference/algorithms/generated/networkx.algorithms.isomorphism.categorical_multiedge_match.html
/usr/share/doc/python-networkx-doc/html/reference/algorithms/generated/networkx.algorithms.isomorphism.categorical_edge_match.html
/usr/share/doc/python-networkx-doc/html/reference/algorithms/generated/networkx.algorithms.isolate.number_of_isolates.html
/usr/share/doc/python-networkx-doc/html/reference/algorithms/generated/networkx.algorithms.isolate.isolates.html
/usr/share/doc/python-networkx-doc/html/reference/algorithms/generated/networkx.algorithms.isolate.is_isolate.html
/usr/share/doc/python-networkx-doc/html/reference/algorithms/generated/networkx.algorithms.hybrid.kl_connected_subgraph.html
/usr/share/doc/python-networkx-doc/html/reference/algorithms/generated/networkx.algorithms.hybrid.is_kl_connected.html
/usr/share/doc/python-networkx-doc/html/reference/algorithms/generated/networkx.algorithms.hierarchy.flow_hierarchy.html
/usr/share/doc/python-networkx-doc/html/reference/algorithms/generated/networkx.algorithms.graphical.is_valid_degree_sequence_havel_hakimi.html
/usr/share/doc/python-networkx-doc/html/reference/algorithms/generated/networkx.algorithms.graphical.is_valid_degree_sequence_erdos_gallai.html
/usr/share/doc/python-networkx-doc/html/reference/algorithms/generated/networkx.algorithms.graphical.is_pseudographical.html
/usr/share/doc/python-networkx-doc/html/reference/algorithms/generated/networkx.algorithms.graphical.is_multigraphical.html
/usr/share/doc/python-networkx-doc/html/reference/algorithms/generated/networkx.algorithms.graphical.is_graphical.html
/usr/share/doc/python-networkx-doc/html/reference/algorithms/generated/networkx.algorithms.graphical.is_digraphical.html
/usr/share/doc/python-networkx-doc/html/reference/algorithms/generated/networkx.algorithms.graph_hashing.weisfeiler_lehman_graph_hash.html
/usr/share/doc/python-networkx-doc/html/reference/algorithms/generated/networkx.algorithms.flow.shortest_augmenting_path.html
/usr/share/doc/python-networkx-doc/html/reference/algorithms/generated/networkx.algorithms.flow.preflow_push.html
/usr/share/doc/python-networkx-doc/html/reference/algorithms/generated/networkx.algorithms.flow.network_simplex.html
/usr/share/doc/python-networkx-doc/html/reference/algorithms/generated/networkx.algorithms.flow.minimum_cut.html
/usr/share/doc/python-networkx-doc/html/reference/algorithms/generated/networkx.algorithms.flow.minimum_cut_value.html
/usr/share/doc/python-networkx-doc/html/reference/algorithms/generated/networkx.algorithms.flow.min_cost_flow.html
/usr/share/doc/python-networkx-doc/html/reference/algorithms/generated/networkx.algorithms.flow.min_cost_flow_cost.html
/usr/share/doc/python-networkx-doc/html/reference/algorithms/generated/networkx.algorithms.flow.maximum_flow.html
/usr/share/doc/python-networkx-doc/html/reference/algorithms/generated/networkx.algorithms.flow.maximum_flow_value.html
/usr/share/doc/python-networkx-doc/html/reference/algorithms/generated/networkx.algorithms.flow.max_flow_min_cost.html
/usr/share/doc/python-networkx-doc/html/reference/algorithms/generated/networkx.algorithms.flow.gomory_hu_tree.html
/usr/share/doc/python-networkx-doc/html/reference/algorithms/generated/networkx.algorithms.flow.edmonds_karp.html
/usr/share/doc/python-networkx-doc/html/reference/algorithms/generated/networkx.algorithms.flow.dinitz.html
/usr/share/doc/python-networkx-doc/html/reference/algorithms/generated/networkx.algorithms.flow.cost_of_flow.html

Uploaded

over 3 years ago

Package Size

9.46 MB

Installed Size

42 MB

Downloads

wget

wget --content-disposition "https://packagecloud.io/faucetsdn/faucet/packages/debian/buster/python-networkx-doc_2.5_all.deb/download.deb?distro_version_id=150"

Homepage

https://networkx.github.io/