Skip to content

Check to see if a mapping exists between 2 graphs (subgraph-isomorphism) by developing optimised SAT clauses and solving them using MINISAT.

Notifications You must be signed in to change notification settings

NikhilGupta1997/SAT-Graph-Mapping

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

15 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

SAT-Graph-Mapping

Steps to Run

Using Script

Run using boot.sh G1_nodes G1_edges G2_nodes G2_edges

Without Script

Compile using compile.sh
Generate a graphs using generate.py G1_nodes G1_edges G2_nodes G2_edges > 'filename.graphs'
Run clause generator using run1.sh filename
Invoke MINISAT using minisat 'filename.satinput' 'filename.satoutput'
Obtain mapping using run2.sh filename
Check correctness using check.py 'filename.graphs' 'filename.mapping'

Authors

Course Project under Prof. Mausam

About

Check to see if a mapping exists between 2 graphs (subgraph-isomorphism) by developing optimised SAT clauses and solving them using MINISAT.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published