Basic Graph Algorithms

Edge (u; v) is incident to u and v Degree of vertex in undirected graph is the number of edges incident to it. In (Out) degree of a vertex in directed graph is the number of edges entering (leaving) it. A path from u1 to u2 is a sequence of vertices < u1=v0; v1; v2; ; vk=u2 > such that (vi; vi+1) 2 E (or fvi; vi+1g 2 E) { We say that u2 is reachable from u1 { The length of the path is k { It is a cycle if v0 = vk