Review: Graphs
l A graph G = (V, E)
n V = set of vertices, E = set of edges
n Dense graph: |E| |V|2; Sparse graph: |E| |V|
n Undirected graph:
u Edge (u,v) = edge (v,u)
u No self-loops
n Directed graph:
u Edge (u,v) goes from vertex u to vertex v, notated uv
n A weighted graph associates weights with either
the edges or the vertices