mclumi.network package

Submodules

mclumi.network.Adjacency module

class mclumi.network.Adjacency.adjacency(graph=None)

Bases: object

dict()
property glen
property graph
property graph_mapped
hash()
property key_mapped
list()
map(graph)
Parameters

graph

matrix()
set()
toEdgeList(rr=True)
Parameters

rr

mclumi.network.CC module

class mclumi.network.CC.cc

Bases: object

deque(graph)
Parameters

graph – 1d dict of an adjacency list

Returns

Return type

2d list, each 1d list representing a component

set(graph)

Examples

>>>seen = set() >>>def component(node): >>> nodes = set([node]) >>> while nodes: >>> node = nodes.pop() >>> seen.add(node) >>> nodes |= neighbors[node] - seen >>> yield node >>> for node in neighbors: >>> if node not in seen: >>> yield component(node)

Parameters

graph – 1d dict of an adjacency list

Returns

Return type

2d list, each 1d list representing a component

mclumi.network.Edge module

class mclumi.network.Edge.edge(graph=None)

Bases: object

fromdf(df, col_name1='node_1', col_name2='node_2', to_tuple=False)
Parameters

  • df

  • col_name1

  • col_name2

  • to_tuple

fromlist(list_2d)
Parameters

list_2d

property glen
property graph
property graph_mapped
property key_mapped
map(graph)
Parameters

graph

property nodes
property rvredanduncy
toAdjacencyDict()

Module contents