Graphy Theory Thread

How in the fuck does one connect each color to itself while going over every dot? Is there math for this?

retard pseudo-math for retard cs shitters

>math
bitch you're connecting dots tf do you mean a "math"?

Start at lower blue, connect to upper blue, then upper pink to lower pink then left turquoise to right turq then lower yellow to upper yellow to upper green to lower green to lower orange to upper orange.

But yes, this is graph theory. What you'd want to do is simply figure out what this problem represents as a graph in abstract terms, then look up whether the process you want to do is possible.

Remember that autism test where you have to connect the houses to the supplies. That's K(3,3) and it's not planar. Hence the problem cannot be done. Once you realise it's K(3,3), some smart guy already proved it's not planar, so you don't have to sit around for hours trying to make it work.

In this case, however, I just saw the solution.

>while going over every dot
figures """"discrete math""""lets can't read

I thought they were just placeholders and did not interpret the question correctly.

On topic, here is a solution if you're allowed to move diagonally across a square. Start at top orange.

It has to be done without moving diagonally though. I've spent two days on this.

Turn in your computer if you hate CS so much. Oh what's that? You're a hypocrite who parrots other people's opinions to try and fit in? Carry on.

Without diagonals, I'd say it was impossible (though I can't prove it). The positioning of the pink and orange on the rim causes the problems. To actually prove it would be an exercise in graph theory.

Maybe you could show that ANY way of connecting orange to orange prevents you from connecting the other colours.

I also wonder if there is a computational analyser that could just brute force it.

Took me 5 minutes, easy as fuck. There are some lines that logically have to be made and then once you make them the solution is pretty clear if you want to fill up the entire space.

Is the 7 bridges problem impossible for any odd number of bridges?