Graphs

Undirected Graph (has no arrows)

Directed Graph (has arrows)

deg = num of arrows coming out of a node

Direction matters on the edges

Complete Graph

Adjacency Matrix

Representation

A B C

A 0 1 1

B 0 1 1

C 0 0 0

Sparce matix is a matrix with - many 0s and few 1s

Path length in a directed graph

Example

Reachability Matrix