Quad‑tree based linear algebra in F# for GraphBLAS‑style graph analysis. This is a prototype for implementations using interaction nets. An example of such an implementation using Inpla can be found in this repository.
Infrastructure for benchmarking the implemented algorithms is available in the respective project. For performance testing details and instructions on how to run them, see the Benchmarks README.
- Single-source level BFS
- Single-source parent BFS
- Single-source shortest path (SSSP)
- Triangles counting
- Boruvka MSF
- Maggs-Plotkin MSF
- AVLSet
- Multiple-source level BFS
- Multiple-source parent BFS
- PageRank
- Single-source RPQ reachability