A python wrapper for flagsercontain which computes the number of directed cliques each vertex of digraph belongs to
Download the repository and submodules with:
- git clone --recursive https://https://github.com/JasonPSmith/pyflagsercontain.git
Then, install with:
- pip install .
In python load with:
- from pyflagsercontain import flagser_count
Given an adjacency matrix M (stored as a numpy array), to get the clique counts call:
- cliquecontain = flagser_count(M)
Then, cliquecontain[v][d] is the number of simplices of dimension d which contain the vertex v.