Jed, That is a beautiful piece of work, and something I always imagined Tiddlywiki would be ideal for.
I may return to investigating the "Travelling salesman problem <https://en.wikipedia.org/wiki/Travelling_salesman_problem#:~:text=The%20travelling%20salesman%20problem%20(also,NP%2Dhard%20problem%20in%20combinatorial>" or my idea to prove the "Four Colour Theorem <https://en.wikipedia.org/wiki/Four_color_theorem>" in a few steps. Things that often occupied me before TiddlyWiki. I am tempted to write a small synopsis of your solution that helps interrogate the graph once it exits. Thanks so much for you participation in building our tiddlywiki resources. Regards Tony On Sunday, August 2, 2020 at 6:23:45 AM UTC+10, Jed Carty wrote: > > It isn't graphical but I made a relations database that may fit what you > are looking for. > > https://ooktech-tw.gitlab.io/plugins/relations/ > -- You received this message because you are subscribed to the Google Groups "TiddlyWiki" group. To unsubscribe from this group and stop receiving emails from it, send an email to tiddlywiki+unsubscr...@googlegroups.com. To view this discussion on the web visit https://groups.google.com/d/msgid/tiddlywiki/70378d26-cde9-4277-8657-0601436b538fo%40googlegroups.com.
