Use a heap to speed up the minimum spanning tree generation
-rw-r--r-- 255 .gitignore
-rw-r--r-- 46875 ast.py
-rwxr-xr-x 137 ast.sh
-rw-r--r-- 2381 bisect_set.py
-rwxr-xr-x 1035 bootstrap_plex.py
-rwxr-xr-x 571 degenerate.py
-rw-r--r-- 7271 dfa.py
drwxr-xr-x - doc
-rw-r--r-- 4193 element.py
-rw-r--r-- 17028 flex_dfa.py
-rwxr-xr-x 13138 generate.py
drwxr-xr-x - lex-yacc-examples
-rw-r--r-- 16509 nfa.py
-rw-r--r-- 848 numpy_heap.py
-rw-r--r-- 35025 regex.py
-rwxr-xr-x 153 regex.sh
drwxr-xr-x - skel
drwxr-xr-x - tests
-rw-r--r-- 5044 work.py