Network science abstract data types
Project description
Graph theory abstract data type.
scinet.Graph is designed upon the graph (abstract data type) definition and functions as a bare bones skeletal graph data mapping, containing abstract vertices and edges.
Includes DiGraph and MultiGraph support, with HyperGraph capabilities.
Installation
- Install Python >= 3.8
- Install scinet
$ pip install scinet-josugoar
Usage
Import scinet
import scinet as sn
Create graph
G = sn.Graph()
Manipulate data
- add_vertex
G.add_vertex(vertex := "foo")
- add_edge
Edges must be assigned using hashable keys so that no name conflicts exist between source_vertex and target_vertex edges
key = G.add_edge(source_vertex := "foo", target_vertex := "bar"[, edge := "foobar"])
- remove_vertex
G.remove_vertex(vertex := "foo")
- remove_edge
G.remove_edge(source_vertex := "foo", target_vertex := "bar"[, edge := "foobar"])")
- adjacent
(target_vertex := "bar") in G[(source_vertex := "foo")]
>>> True
- neighbors
set(G[(vertex := "foo")])
>>> { "neighbor_1", "neighbor_2", ... }
See docs for further details.
Contributors
- josugoar - Main contributor - GitHub
Project details
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
scinet-josugoar-0.5.5.tar.gz
(4.3 kB
view hashes)
Built Distribution
Close
Hashes for scinet_josugoar-0.5.5-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 15084903dc5dd4cf1c4862ecf60d74bc9938e738438df51c968f7232b8c95e6e |
|
MD5 | 3051f1b5d264d87761e0f5c6d7c42960 |
|
BLAKE2b-256 | b4b619b0d299e4d1636552988611e198859f92051e2e38c1575a3c2487ec9018 |