Last active
July 25, 2021 01:50
-
-
Save mgritter/07e4a66474bb37e657c35ac583634da1 to your computer and use it in GitHub Desktop.
Soffit grammar for Henneberg sequences generating minimal generically rigid graphs
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| { | |
| "version": "0.1", | |
| "start": "A--B", | |
| "A; B": "B--N--A", | |
| "A--B; C": "A--D; B--D; C--D" | |
| } |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment