Thread replies: 15
Thread images: 3
Thread images: 3
Let´s play a game, /sci
You must trace a path where
-You must return to the starting point
-You can only go through a segment ONCE
Let the game begin.
>>
fdcf
Are you stupid or something?
Just learned about graph theory?
>>
>>7972660
going through all segments :3
>>
>>7972653
them rules
>>
>>7972662
All lines or all points?
>>
bedbadcf
>>
>>7972689
really bro? on /sci???
al lines
begining and end point must be the same
>>
File: 1438919084759.png (26KB, 861x758px) Image search:
[Google]
26KB, 861x758px
>oh look, it's high schooler #3257563902 who just found out about the simplest graph theory problem and needs to post about it on /sci/
>>
>>7972695
nope.
If you start at b, must end at b.
>>
>>7972653
bfabdcfed
Just learn about Eulerian trails, OP?
>>
>>7972700
if it is that simple, why don´t you solve it?
Until now, nobody seems to get it.
>>
>>7972696
Dude thats the difference between a Hamilton and an Euler circle.
Don't see the problem
>>
Its not possible, cause to points have a degree of three, which is not dividible by 2.
Source: Look up the wikipedia page to Euler circles
>>
>>7972653
>having to look it up
I know no graph theory and I quickly realized this from thinking about OP's problem.
>>
>>7972715
So tell me, why the degree has to be dividible by 2.
I swear sci is full of high(IQ) schoolers\trolls
Thread posts: 15
Thread images: 3
Thread images: 3