Graph Theory (for Computer Science) - A Short Overview

[@garklein8089]

3:59 the one on the left can be taken apart into 2 separate triangles, while every dot on the right is hooked into the same loop!

[@DaedalusCommunity]

Exactly!

[@mesmodev]

The hero is back!

[@kvelez]

Excellent video.

[@c4llv07e]

>>3:27 My Haskell PTSD has hit me so hard here.. /j Great video, I like the new videos on this channel!

[@Ph4n_t0m]

Lisp... say no more

[@biratuba]

The caracterization of of the problem at 8:09 is actually the caracterization of an Eulerian Cycle instead of an Eulerian Path, for an eulerian Path you need that at most to vertices have degree odd. Also, it is missing the demand for the graph to be connected.

[@DaedalusCommunity]

I did write that in the note on the bottom :) But you're right, I forgot to mention that the graph needs to be connected, as I was talking about the specific case of the example

[@mastcharub7177]

Another Banger is out!