Back to Results
First PageMeta Content



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

Document Date: 2013-11-01 09:55:34


Open Document

File Size: 1,06 MB

Share Result on Facebook
UPDATE