It was obvious from the start but I didn’t do it because “It take more time because of how complex it is” not only the fact that I practically understand it but also like I’ve haven’t worked on this thing for a whole year or so-
I’ll still have to make some adjustments for the connections but other than that, yeah it’s nothing too bad I just gotta actually program the directed graphs in
I just found out there can be cycles in cycles, and those cycles actually have really familiar patterns that can be easily solved and…
Wait I think I’m onto something
(I hope)
Ok I’m calmer from earlier now lol
But I did also find out that Geometry only cycles can exist
Which isn’t too much of a problem because the fix on that is just by comparing Ys to each other and breaking off the one with the grater one to the lesser one
The Chinese was actually French!
The most random ad I saw on Youtube
Elliott Speedin
BEWARE THE NOID.
(The classical ol'Dominos mascot)
.
Powah
(add the dust man theme from mega man 4) omg its dust man from fnf
I also found out too that there CAN be cycles that are more than 4(times which I thought a cycle consisting of four connected nodes would be impossible but I guess not)
However, the same method I had before STILL WORKS!!
I’m 💯 confident this is it
0 comments