SMArt.graph package

Submodules

SMArt.graph.incl module

G - graph defined as a dictionary (G.adj) v - vertex e - edges

class SMArt.graph.incl.Graph(adj_dict_edges=None, flag_edges=False, adj_type=<class 'collections.defaultdict'>, adj_format_new_vertex=<class 'set'>, **kwargs)

Bases: SMArt.incl.__VersionCompatibility

graph defined as a dictionary (adjacency list)

BFS(v, **kwargs)

Breath-first search - generator :param v: :param kwargs:

flag_stack_level [True] flag_v_list stack_visited visited visited_from_stack [True]

Returns

BFS_d(v, d, **kwargs)

Breath-first search with depth - finds first d neighbours (all from 1 to d) :param v: :param kwargs:

flag_stack_level [True] flag_v_list stack_visited visited visited_from_stack [True]

BFS_d_f(v, d, f, *args, **kwargs)

Breath-first search with depth (see BFS_d) - together with an on-the-fly-function

example: def f(*args, **kwargs):

cur = kwargs[‘BFS_local’][0] kwargs[“all_v”].append(cur)

self.BFS_d_f(v,d,f,all_v=[])

returns ((), {‘all_v’:[v1,v2,v3,…]})

BFS_f(v, f, *args, **kwargs)

Breath-first search - with an on-the-fly-function

example: def f(*args, **kwargs):

cur = kwargs[‘BFS_local’][0] kwargs[“all_v”].append(cur)

G.BFS_f(v,f,all_v=[])

returns ((), {‘all_v’:[v1,v2,v3,…]})

BFS_l(v, level, **kwargs)

Breath-first search with level - finds all l-th neighbours (not including <l) :param v: :param kwargs:

flag_stack_level [True] flag_v_list stack_visited visited visited_from_stack [True]

DFS(v, **kwargs)

Depth-first search - generator

DFS_f(v, f, *args, **kwargs)

Depth-first search - with an on-the-fly-function

example: def f(*args, **kwargs):

cur = kwargs[‘DFS_local’][0] kwargs[“all_v”].append(cur)

self.DFS_f(v,f,all_v=[]) returns ((), {‘all_v’:[v1,v2,v3,…]})

add_edge(edge)

add_edges(edges)

check_G()

check if adjacency list is correct

dist(v1, v2)

distance between v1 and v2

edges2adj(edges)

from edges to adjacency dictionary

find_rings(flag_root_at=False, **kwargs)

find_rings_graph(flag_root_at=False, **kwargs)

get_2D_repr(vertices=None, d_12=1.0, d_13=1.7, Fk=100, 50, 5, rest_pow=1, Nmaxiter=25, **kwargs)

Parameters

• vertices –

• kwargs – fig_name, step, init_struc

Returns

get_Gs()

if G is not connected, finds separate Gs

get_edges()

from graph to edges - generator

remove_edge(edge)

set_adj_type_format(set_adj_type=None, set_adj_format=None, **kwargs)

Parameters

• set_adj_type – self.adj type

• set_adj_format – type of each element in self.adj

• kwargs –

Returns

sub_graph(vertices, **kwargs)

creates a subgraph :param vertices: :param kwargs:

adj_fromat (set, tuple)

Returns

update_adj(additional_adj)

class SMArt.graph.incl.GraphDirected(adj_dict_edges=None, flag_edges=False, parents=None, **kwargs)

Bases: SMArt.graph.incl.Graph

directed_BFS()

find_shortest_rpath()

get_add_missing_groups(**kwargs)

get_p_c(**kwargs)

iterate over vertices and get parents and children :param kwargs:

level - max level flag_children_level_map - if and how many levels to add to the map (default 0; -1 adds all levels)

Returns

get_parents(v, path=None)

set_parents(*v, **kwargs)

class SMArt.graph.incl.Vertex(l, p=None)

Bases: SMArt.incl.__VersionCompatibility

add_c(c)

add_p(p)

c

l

p

Module contents