Graphs A graphG=(N, A) is a finite nonempty set of nodes and a set of node pairs a called arcs or links or edges) N={123} N={1,2,3,4 A={12),(2,3),(1,4,(24)} A={(1,2) Eytan ModianoGraphs • A graph G = (N,A) is a finite nonempty set of nodes and a set of node pairs A called arcs (or links or edges) 1 2 3 1 2 3 4 N = {1,2,3} N = {1,2,3,4} A = {(1,2),(2,3),(1,4),(2,4)} A = {(1,2)} Eytan Modiano Slide 5