Establish what kinds of graph algorithms are theoretically possible

[refset]

To clarify the extent to which Crux may be used as a "graph database" we should summarise what kinds of graph algorithms we believe are actually possible using the existing rules capability (or may be constructed via decorators).

e.g. Shortest Path: is there a way to implement a "bidirectional breadth-first search"? (see https://hashrocket.com/blog/posts/using-datomic-as-a-graph-database)

A large categorised list of commonly available graph algorithms:
https://neo4j.com/docs/graph-algorithms/current/

[refset]

See https://github.com/juxt/crux/blob/master/example/imdb/src/imdb/main.clj