Lecture-27

書籍內容簡介

Lecture 27: Study of Complexity factor, Big ?h??criteria Summary of Lecture: ??Adjacency Matrix ??Big Oh criteria SEQUENTIAL REPRESENTATION OF GRAPHS; ADJACENCY MATRIX; PATH MATRIX There are two standard ways of maintaining a graph G in the memory of a computer. One way, called the sequential representation of G, is by means of its adjacency matrix A. The other way, called the linked representation of G, is by means of linked lists of neighbors. Regardless of the way one maintains a graph G in…