The minimum cuts module

Minimum cuts class.

class hcga.features.minimum_cuts.MinimumCuts(graph=None)

Minimum cuts class.

Features derived from the minimum cuts of a graph.

The minimum cuts explores the set of nodes or edges of minimum cardinality that, if removed, would destroy all paths among source and target in G.

Calculations using networkx:

Networkx_minimum_cuts

References

1

Abdol-Hossein Esfahanian. Connectivity Algorithms. http://www.cse.msu.edu/~cse835/Papers/Graph_connectivity_revised.pdf

Initialise a feature class.

Parameters

graph (Graph) – graph for initialisation, converted to given encoding

compute_features()

Main feature extraction function.

This function should be used by each specific feature class to add new features.

hcga.features.minimum_cuts.min_edge_cut_size(graph)

min_node_cut_size

hcga.features.minimum_cuts.min_node_cut_size(graph)