Graph Theory: Euler Paths and Euler Circuits

Transcript

• WELCOME TO A LESSON ON EULER PATHS AND EULER CIRCUITS. AN EULER PATH IS A PATH THAT USES EVERY EDGE IN A GRAPH WITH NO REPEATS. BEING A PATH, IT DOES NOT HAVE TO RETURN TO THE STARTING VERTEX. SO LOOKING AT THIS FIRST GRAPH HERE, THERE'S MORE THAN ONE WAY TO FORM A EULER PATH. FOR EXAMPLE, IF WE START AT VERTEX C, WE GO FROM C TO B, FROM B ... Read More