Graph Algorithms Representations of graph G with vertices V and edges E ● V x V adjacency-matrix A: Au, v = 1  (u, v) ∈ E Size: |V|2 Better for dense graphs, i.e., |E| = Ω(|V|2)

First Page		Document Content
Date: 2013-11-01 09:55:34		Graph Algorithms Representations of graph G with vertices V and edges E ● V x V adjacency-matrix A: Au, v = 1  (u, v) ∈ E Size: \|V\|2 Better for dense graphs, i.e., \|E\| = Ω(\|V\|2) Add to Reading List Source URL: www.ccs.neu.edu Download Document from Source Website File Size: 1,06 MB Share Document on Facebook