adjacency lists
Tags: algorithms
Ways to keep track of neighbors in a graph, you represent the graph by simply keeping a KV store similar to
| Node | Neighbors |
|---|---|
| A | <B, C> |
Tags: algorithms
Ways to keep track of neighbors in a graph, you represent the graph by simply keeping a KV store similar to
| Node | Neighbors |
|---|---|
| A | <B, C> |