Implement graphs using dictionaries

jeffwack111 / Spiders

0 stars 0 forks source link

Implement graphs using dictionaries #19

Closed jeffwack111 closed 3 months ago

jeffwack111 commented 6 months ago

This will allow for several improvements having to do with subgraphs making sense. The name of a node will no longer be tied to its position in the adjacency list.

jeffwack111 commented 6 months ago

use the kneading sequences themselves as keys??

jeffwack111 commented 6 months ago

This will require a rewrite of all the functions that operate on Hubbard trees.

hubbardtree
embedtree
binary
components
characteristicpoints
etc??

jeffwack111 commented 5 months ago

comparing old and new hubbard trees is failing. 7//9 is a fairly small example.

jeffwack111 commented 4 months ago

Hubbard trees are being generated correctly now, and the remaining functions to be implemented are embedtree() and binary()

jeffwack111 commented 4 months ago

only remaining function is binary!

jeffwack111 commented 3 months ago

the problem of sensibly generating all 4 angles of a given embedded tree remains, but the functionality now is better than before moving to dictionary graphs