exp-checkGED is a tool to validate GEDs or GFDs. GED or GFD is a structure consisting with a graph pattern and a relation between X and Y, which is X->Y, each of them is a set of literals. Note: While graph isomorphism is NP-Complete, the efficiency of validation in large graph with high repetition rate of label is costly.
Remap graphs and GEDs (or GFDs) because continous vertices with ids starting from zero are necessary.
$./script/remap.sh $GRAPH_FILE_PATH $GED_FILE_PATH
Please use absolute path.
- $GRAPH_FILE_PATH contains vertex file and edge file. g.v and g.e are necessary in this path. e.g.
$GRAPH_FILE_PATH=~/data/g
- $GED_FILE_PATH contains GEDs (or GFDs) file. g.ged is necessary in this path. e.g.
$GED_FILE_PATH=~/data/g.ged
It produces g.remap.v, g.remap.e, g.ged.remap.
-
g.remap.*: mappings of original graph, whose ids are started from 0 and continous.
-
g.ged.remap: mappings of original GEDs, whose ids are started frome 0 and continous.
Check whether GEDs(or GFDs) are correct mainly using graph isomorphism algorithm vf2.
$./script/run.sh $GRAPH_FILE_PATH $GED_FILE_PATH
Please use absolute path and remap files.
- $GRAPH_FILE_PATH contains vertex file and edge file. g.remap.v and g.remap.e are necessary in this path. e.g.
$GRAPH_FILE_PATH=~/data/g.remap
- $GED_FILE_PATH contains GEDs (or GFDs) file. g.ged.remap is necessary in this path. e.g.
$GED_FILE_PATH=~/data/g.ged.remap
It produces g.ged.remap.log, g.ged.remap.map and g.ged.remap.vali.
-
g.ged.remap.log: validation-GEDs running log.
-
g.ged.remap.map: mappings between GED's pattern and graph, which uses algorithm vf2.
-
g.ged.remap.vali: result file containing correct GEDs.