-
Notifications
You must be signed in to change notification settings - Fork 2
Graph Note
Xin Wan edited this page Feb 12, 2018
·
27 revisions
- adjacent matric
class Graph {
boolean[][] adjacentMatrix;
}
class Graph {
Weight[][] adjacentMatric;
}Space: O(|V|^2) Pros: Lookup edge for a certain pair - O(1) Cons: Possible sparse matrix if |E| << |V|
- Adjacent List
class Vertex {
int id;
List<Vertex> neighbors;
}
class Graph {
List<Vertex> vertices;
}Pros: space: O(|V| + |E|)