Difference between revisions of "NetworkX"
Jump to navigation
Jump to search
| Line 1: | Line 1: | ||
[[wikipedia:NetworkX]] | [[wikipedia:NetworkX]] | ||
| + | |||
| + | == Features == | ||
| + | * [[Class (computer programming)|Classes]] for graphs and [[Directed graph|digraphs]]. | ||
| + | * Conversion of graphs to and from several formats. | ||
| + | * Ability to construct [[random graph]]s or construct them incrementally. | ||
| + | * Ability to find [[Glossary of graph theory#subgraph|subgraphs]], [[Clique (graph theory)|cliques]], [[Degeneracy (graph theory)|k-cores]]. | ||
| + | * Explore [[Glossary of graph theory terms#adjacent|adjacency]], [[Degree (graph theory)|degree]], [[Glossary of graph theory#diameter|diameter]], [[Glossary of graph theory#radius|radius]], [[Glossary of graph theory#center|center]], [[betweenness]], etc. | ||
| + | * Draw networks in 2D and 3D. | ||
* [[Graph.nodes]] | * [[Graph.nodes]] | ||
Revision as of 10:22, 14 February 2023
Features
- Classes for graphs and digraphs.
- Conversion of graphs to and from several formats.
- Ability to construct random graphs or construct them incrementally.
- Ability to find subgraphs, cliques, k-cores.
- Explore adjacency, degree, diameter, radius, center, betweenness, etc.
- Draw networks in 2D and 3D.
Advertising:
