CSE 214 Lecture Notes - Lecture 33: Linked List, Nodeb, Adjacency Matrix
7 Dec 2016
School
Department
Course
Professor
Document Summary
A graph g = (v,e) is a set of verticies v and a collection of edges e. An edge e = (x,y) is said to connect vertext x to vertex y and vice versa. An edge e = (x,y) is said to connect vertex x and y but not vertex y to x. Has no multiple edges between vertices or loops from vertex or itself. Undirected edge (arc) (node a to node b , node b to node a) Loop (path from noda a to noda a (self)) Cycle (node a to node b to node c to node a). Adjacency matrix g for an n node graph is an n * n array of boolean values such that gik = true if vertex k is adjacent to vertex i; otherwise gik = false. In other words, gik = true if there is an edge from vertex i to vertex k, otherwise it is false;
