Lucian 🎩
@lucian.solutions
Programmer, Illustrator, Guest Chart Designer at #DJMax
Sub :: @dev.lucian.solutions
Sub :: @dev.lucian.solutions
Since the start and stop are the same colour, it is mathematically impossible.
October 24, 2025 at 10:34 AM
Since the start and stop are the same colour, it is mathematically impossible.
2 nodes have exactly 1 neighbour so they’re designated start and stop.
From the layout, both of them are the same colour. (Remember this)
Now count the number of all nodes: 14
Graph theorem states: If the odd step nodes are A, even will be B
From the layout, both of them are the same colour. (Remember this)
Now count the number of all nodes: 14
Graph theorem states: If the odd step nodes are A, even will be B
October 24, 2025 at 10:34 AM
2 nodes have exactly 1 neighbour so they’re designated start and stop.
From the layout, both of them are the same colour. (Remember this)
Now count the number of all nodes: 14
Graph theorem states: If the odd step nodes are A, even will be B
From the layout, both of them are the same colour. (Remember this)
Now count the number of all nodes: 14
Graph theorem states: If the odd step nodes are A, even will be B
