DigplexQ is a Python package to perform computations with digraph-based complexes (directed flag complexes and path complexes). It is an "adjacency matrix-centered" package since it was designed so that the user can perform all computations just by entering an adjacency matrix as input.
- Free software: MIT license
- Documentation: TODO
pip3 install digplexqfrom digplexq.directed_q_analysis import *
from digplexq.digraph_based_complexes import *
from digplexq.structure_based_simplicial_measures import *
from digplexq.random_digraphs import *
from digplexq.utils import *
M = directed_erdos_renyi_GnM_model(20, 40, weight=False)
M = remove_double_edges(M) #remove double edges.
#Directed flag complex:
DFC = DirectedFlagComplex(M, "by_dimension_with_nodes")
#Maximal directed simplices:
maxsimp = MaximalSimplices(DFC)
#q-Adjacency matrix:
fast_q_adjacency_matrix(M, q=1)
#in-q-degree centrality
in_q_degree_centrality(M, q=1, results="nodes")More examples are available in the .
