Lecture 15. Graph Algorithms
Lecture 15. Graph Algorithms. An undirected graph G is a pair (V,E) , where V is a finite set of points called vertices and E is a finite set of edges . An edge e ∈ E is an unordered pair (u,v) , where u,v ∈ V .
152 views • 14 slides