Chapter 8, Part I
Chapter 8, Part I. Graph Algorithms. Graph Terminology. A graph is an ordered pair G=(V,E) with a set of vertices or nodes and the edges that connect them the nodes . (u,v) are called the endpoints of e and u and v are said to be adjacent nodes or neighbors.
330 views • 19 slides