This project contains code to extract a graph grammar from a graph.

Details of the algorithm will be put in a paper.

python test.py [args]

run python test.py -h for a full list of options

Name		Name	Last commit message	Last commit date
Latest commit History 222 Commits
VRG		VRG
graphs		graphs
graphs_for_satyaki		graphs_for_satyaki
old_code		old_code
output_files		output_files
subdue		subdue
vog		vog
.gitignore		.gitignore
approximate_rule_utils.py		approximate_rule_utils.py
augmented_pq.py		augmented_pq.py
difference_in_extracted_rules.py		difference_in_extracted_rules.py
full_approximate_rule_miner.py		full_approximate_rule_miner.py
generation.py		generation.py
konect_to_adjacency_list.py		konect_to_adjacency_list.py
manual_dblp_analysis.py		manual_dblp_analysis.py
paper_example.py		paper_example.py
progressive_edge_replacement.sh		progressive_edge_replacement.sh
progressive_rule_sizes.sh		progressive_rule_sizes.sh
readme.md		readme.md
rule_lib.py		rule_lib.py
rule_miner_base.py		rule_miner_base.py
rule_pq.py		rule_pq.py
test.py		test.py
test_utils.py		test_utils.py