Is this part of Mr. Euler's fancy graph formula thingy?
Right away! Also not the person I expected (Joshua)
Ok. I'm here. Confused by Wingate's remark. I don't see what this has to do with Eulerian networks. It looks more like something for the traveling salesman problem.
I think this may be related to the traveling salesman. The tipoff re: Eulerianism is looking at how the nodes/vertices are connected to how many other vertices and looking for any repetition of edges. (Basically it's in the numbering).I would have said that both of these graphs represent an Eulerian circuit.... except the second one has some odd-degreed nodes.... so I guess that one's just an Eulerian path.
Lemme see if I have a TSP graphic for you guys...
What Wingate said. It was the graphic I made for a hw assigment to draw an Euler circuit and draw an Euler Path. I know I'm pathetic putting up old hw and reposting old material (no one noticed, though). I wanted to get some stuff up but, this is crunch season, being combined Pesach cleaning and midterms at the same time. I'm taking 16 credits, too, including Corp. Finance which is one of the hardest, if not the hardest classes on the business major agenda.
Ah, yes that makes sense. I should have noticed the multiple paths between points and the fact that the edge numbers actually went in order.
I don't know where the comment went but, Joshuah, who is Weiss?