01:198:112 Lecture Notes - Lecture 19: Linked List, Adjacency Matrix
11 Apr 2019
School
Department
Course
Professor
Document Summary
The amount of neighbors(the amount of connected vertices) has represents the. E. g. a node with a degree of two has two neighboring vertices node"s degree. Columbia has a border(edge) with panama as panama has a border(edge) with. Since it is by itself, a graph of australia would be considered unconnected. Edges have only one direction, not two way. You need to take cs 111 to take cs 112. Nodes in directed graphs have two types degrees. Amount of edges arriving at the node. E. g. looking at the above example, cs 111 has 0 in degrees, but 1 out degree, while cs 112 has 1 in degree, but 0 out degrees. Strongly connected graphs are if there is a path from every vertex to every other vertex. Weakly connected graphs are if by ignoring the direction of the edges the resulting graph is conneccted. Graphs can have weights on the edges.
