GitHub - redundant/Graphy: Computes graph identities in strongly regular graphs. Undergraduate research project at CMU. GPL3

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 26 Commits
NonIMicGraphs		NonIMicGraphs
README		README
expression.cpp		expression.cpp
expression.h		expression.h
expressions.exp		expressions.exp
graph.cpp		graph.cpp
graph.h		graph.h
lincomb.cpp		lincomb.cpp
lincomb.h		lincomb.h
main.cpp		main.cpp
nonimic.cpp		nonimic.cpp
nonimic.h		nonimic.h

Repository files navigation

This is a graph identity generation program created as part of an
undergraduate research project at CMU.

Looking back at this, the code is really ill-commented. It's a bit messy as I've hard coded all the strongly regular graphs on a certain number of vertices.

The code is gnu gplv3.