this is for holding javascript data
Fernando Perez edited Graph_structures__.md
almost 9 years ago
Commit id: efe7e61c267eacf0e6f9fc2fb7f7b1d967532ee7
deletions | additions
diff --git a/Graph_structures__.md b/Graph_structures__.md
index 3726fb1..57ea819 100644
--- a/Graph_structures__.md
+++ b/Graph_structures__.md
...
## Graph structures
A simple graph is a collection of vertices and edges. The most basic distinction is: directed vs undirected, weighted vs unweighted, both referring to the edges.
Typical representations:
* Adjacency matrix:
* Symmetric matrix: undirected graph.
* Asymmetric matrix: directed graph.
For an unweighted graph, the matrix entries are either 0 or 1, for a weighted graph, they can be any value (the weight of the edge).
* Adjacency list: `Array[List[VertexId]]`.
