6120a Discrete Mathematics And Proof For Computer Science Fix !!top!! -

Stop asking "What is the answer?" Start asking "What is the argument that guarantees the answer?"

A graph is a pair $G = (V, E)$, where $V$ is a set of nodes and $E$ is a set of edges. Stop asking "What is the answer

6120a uses a precise set language. Programming intuition fails here because 2,2,3 is still 2,3 in math—sets have no duplicates. 3 is still 2