Skip to content

About

Quad tree based linear algebra in F#

Topics

Resources

Stars

0 stars

Watchers

0 watching

Forks

Repository files navigation

.NET Tests

QTreeFSharp

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.

Benchmarks

Infrastructure for benchmarking the implemented algorithms is available in the QuadTree.Benchmark and Graph.Benchmark projects, sharing the Benchmark.Common utilities and the data/ matrix folder. For performance testing details and instructions on how to run them, see the Benchmarks READMEs.

Implemented Algorithms

  • Single-source level BFS
  • Single-source parent BFS
  • Single-source shortest path (SSSP)
  • Triangles counting
  • Boruvka MSF
  • Maggs-Plotkin MSF

Data Structures

  • AVLSet

TODO

  • Multiple-source level BFS
  • Multiple-source parent BFS
  • PageRank
  • Single-source RPQ reachability

About

Quad tree based linear algebra in F#

Topics

Resources

Stars

0 stars

Watchers

0 watching

Forks

Releases

Packages

Contributors

Languages