Tools that enable operations on graphs where grapsh are represented by an adjacency Mapping.
Project description
# meshed
Tools that enable operations on graphs where grapsh are represented by an adjacency Mapping.
# Examples
`pydocstring >>> from meshed.itools import edges, nodes, isolated_nodes >>> graph = dict(a='c', b='ce', c='abde', d='c', e=['c', 'b'], f={}) >>> sorted(edges(graph)) [('a', 'c'), ('b', 'c'), ('b', 'e'), ('c', 'a'), ('c', 'b'), ('c', 'd'), ('c', 'e'), ('d', 'c'), ('e', 'b'), ('e', 'c')] >>> sorted(nodes(graph)) ['a', 'b', 'c', 'd', 'e', 'f'] >>> set(isolated_nodes(graph)) {'f'} `
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
meshed-0.0.2.tar.gz
(2.8 kB
view hashes)
Built Distribution
Close
Hashes for meshed-0.0.2-py2.py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 927cfaff81193989e8fc13a8f40933e422b7c05573b4be4ad71b193e055aab9c |
|
MD5 | 880a14f4f37afebab4624bea28c8a83e |
|
BLAKE2b-256 | 653cb463fa4825e545d31dc17e99c7ce75b2f553efe0b363850692ebda90ae83 |