Purely functional, typeclass-driven graph and tree traversal library for Scala 3

A generic, typeclass-driven game-playing framework for Scala 3, supporting MCTS, minimax, and reinforcement learning

Scala 3, functional abstract data types supporting implementations of classic graph algorithms — DFS, BFS, Dijkstra, Prim, Bellman-Ford, Kruskal, Kosaraju, and more — built on the Visitor typeclass engine.