aograph 0.6.0

AND-OR graph data structures and algorithms

Coverage
77.78%
14 out of 18 items documented0 out of 3 items with examples
Size
Source code size: 40.19 kB This is the summed size of all the files inside the crates.io package for this release.
Documentation size: 7.6 MB This is the summed size of all files generated by rustdoc for all configured targets
Ø build duration
this release: 36s Average build duration of successful builds.
all releases: 36s Average build duration of successful builds in releases after 2024-10-23.
Links
justinlubin/aograph-rs
0 0 0
crates.io
Dependencies
Versions
Owners

AND-OR graph data structures and algorithms.

The main data structure, [Graph], is a bipartite graph of AND nodes (representing rules in a proof system) and OR nodes (representing propositions in a proof system). [Graph]s have a designated goal OR node that represents the goal to be proven.

A convenient way to construct and store these graphs is to use the [From<jsongraph::Graph>] trait implementation in [Graph]. Otherwise, AND-OR graphs can be created with [Graph::new].