sub_cells.at

Lines:
345
Definitions:
38
Dependencies:
basic.atlietypes.atK.atW_reps.atcells.at
Source:
GitHub

Definitions

NameSignatureDescription
is_complexic) = bool:
is_strictly_complexG) = bool:
swapped_factorsG) = [(int,int)]:
left_factorsG)=[RootDatum]:
left_rootsG)=mat:
left_corootsG)=mat:
left_copyG)=RootDatum:
left_root_indicesG) = [int]:
right_factorsG)=[RootDatum]:
right_rootsG)=mat:
right_corootsG)=mat:
right_copyG)=RootDatum:
right_root_indicesG)=[int]:
taugraph,int i)=[int]:let (tau,)=graph.nodes[i] in tau
in_taugraph,int i, int j)=bool:
intersectionS,[int] T)=[int]:
digraphgraph)=WGraph:
intersectionA,[int] B)=[int]:
sub_digraphgraph,[int] S)=WGraph:
sub_graphgraph,[int] S)=WGraph:
linksgraph)=[[int]]:
strong_componentsg)=[WCell]: {[([int],WGraph)]:}[([int],WGraph)]:
strong_componentscell)=[WCell]:{[([int],WGraph)]:}[([int],WGraph)]:
sub_cells(nodes,graph,ops),[int] S)=[WCell]:
left_cellsG, WCell cell) = [WCell]:
right_cellsG,WCell cell)=[WCell]:
left_cell_ofp) = WCell:
G
p
left_cell_of_oldp) = WCell:
extract_nodesg, [int] nodes)=WGraph:
showg)=void:
show(vertices,g,))=
showgraphs)=void:
showcells)=void:
short_stringlist,int max)=
show_shortcells)=void:
exportg)=string: