Repository navigation

second-order-graph-trial

Public

About

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

0 stars

1 watching

Report repository

Name		Name	Last commit message	Last commit date
benches		benches
common		common
for-loops-and-hashmaps		for-loops-and-hashmaps
utilities		utilities
with-ascent		with-ascent
with-crepe		with-crepe
.gitignore		.gitignore
Cargo.lock		Cargo.lock
Cargo.toml		Cargo.toml
README.md		README.md

Repository files navigation

Problem

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.

Solutions

A Datalog one using Crepe
Another Datalog one using Ascent
A hand-coded one with HashMaps

Benchmarks

cargo criterion

About

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

0 stars

1 watching

Report repository

Releases

Packages

Contributors

Languages