we should validate updates to the site by running sbt mdoc on relevant PRs

At Graph instantiation time, we sort vertices in "key order", so that the vertices are exactly the integers from 1 to |V|. In this way, for search every Dictionary>>...

The original Dijkstra implementation which we borrowed from @len had a bug that the queue didn't know when the weights update. As a quick-and-dirty proof-of-concept, I inserted queue reSort...

The branch https://github.com/shingarov/MachineArithmetic/tree/syntactic-adt flirts with an approach inspired by Haskell's Megaparsec. In a lot of code we added in the last year, grammar is...

As soon as we have #17 figured out, the NNFParser should be picked out into extensions of ADT classes such as CstrAnd and friends. The other "proof DSLs" -- see SpriteParser and M...

Despite our Metacello baseline providing in accord with the recent Discussion at feenkcom/gtoolkit#2306 , the package DepthFirstSearch-GT still somehow doesn't load when hosting in a GT ima...

One of the strengths of GT is that it provides state-of-the-art graph visualization. The package DepthFirstSearch-GT currently contains rudimentary doodles of how we might visualize our Graph and i...