Bow-tie structure detection in directed networks
A python implementation for the detection of a bow-tie structure in a directed network, following the definition as in: "Bow-tie Decomposition in Directed Graphs" - Yang et al. IEEE (2011)
The provided jupyter notebook
contains a working example.
- Loading a directed network/graph, either as the corresponding adjacency matrix in
numpy.array
format or as aNetworkX.DiGraph
G = nx.DiGraph(nx.scale_free_graph(16, seed=14))
- Running the detection function
S, IN, OUT, TUBES, INTENDRILS, OUTTENDRILS, OTHER = get_bowtie_components(graph=G)