For a bipartite graph of {P, R}, partition P into sets such that every element in partition is adjacent to exactly the same nodes in R.
- A Datalog one using Crepe
- Another Datalog one using Ascent
- A hand-coded one with HashMaps
cargo criterion
robert-chiniquy/second-order-graph-trial
Folders and files
| Name | Name | Last commit date | ||
|---|---|---|---|---|