- To represent a sparse graph, you can use a range of techniques.
- One is to have each node carry a list (or array) of the edges leaving it.
- For really sparse graphs (E < N), you might just want to enumerate the edges.
- It also depends on the uses of the graph.
- Note that these methods are interchangeable in effect, but have different speed and memory tradeoffs.