F is a set of forbidden subgraphs. If a graph doesn't contain any of them the graph is considered to be F-free. graphedit tries to find F-free graphs close to the input graph by editing (inserting and ...

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.