## 2-simplices finder

Jupyter notebook to find all 2-simplices in a given DGL graph

Jupyter notebook to find all 2-simplices in a given DGL graph

This Jupyter notebook encodes a solution to the problem of finding all n-simplices within a graph.

Constructing the coskeleton of a Delta set

GNN that message passes features within a simplex, essentially bottlenecking it within a simplex

Jupyter notebook to find initial configurationf of a given evolution of a *Game of Life*

Python scripts to construct various simplicial sets in different circumstances

GNN that message passes features of pseudotop vertices, after a refinement

Finding simplices of a directed graph using adjacency matrix