◮ An abstract way of representing connectivity using nodes (also called vertices) and edges ◮ We will label the nodes … See more

◮ Need to store both the set of nodes V and the set of edges E Nodes can be stored in an array Edges must be stored in some other way ◮ Want to support operations such as: Retrieving all edges incident to … See more

◮ Each node has a list of outgoing edges from it Easy to iterate over edges incident to a certain node The lists have variable lengths Space usage: Θ(n + m) See more

◮ Directed Acyclic Graph (DAG): the name says what it is – Equivalent to a partial ordering of nodes ◮ Bipartite Graph: Nodes can be separated into two groups S and T such that edges exist between S and T only (no edges … See more

Topological Sort Eulerian Circuit Minimum Spanning Tree (MST) Strongly Connected Components (SCC) See more