LSD.auxiliary_graph

The package that contains the auxiliary graph class.

class LSD.auxiliary_graph.AuxiliaryGraph(number)

The auxiliary graph representation. It is in the core a subgraph of the complete NetworkX graph. However, it have an other initialisation, some extra features and depend slightly different.

__init__(number)

Save the number of the graph.

__iter__()

Iterate over the vertices of the graph (exluding a and b).

a

Get the artificial source of the graph.

add(v)

Add a vertex to the axiliary graph.

b

Get the artificial sink of the graph.

connect2sink(v)

Connect v with a

connect2source(v)

Connect v with b

copy_graph(g)

Create with the vertices a induced subgraph. Add also a and b.

get_color(v)

Get the color of v.

has_no_color(v)

Check if a vertex have no color.

in_degree(v)

Get the in degree of a vertex.

nodes

Get all vertices of a graph (including a and b).

nr

Get the number of this part.

out_degree(v)

Get the out degree of a vertex

predecessors(v)

Get all predeccessors of a vertex.

remove_edge(f, t)

Remove an edge from f to t from the graph.

set_color(v, c)

Set the color of v to c.

sink_connected()

Check if b is connected.

source_connected()

Check if a us connected.

successors(v)

Get all successors of a vertex.