Enhanced implementation techniques

An adjacency matrix is an easy and effective way to implement a graph in memory. However, it is not the best way to do it. Some graphs cannot be implemented using the basic boolean matrix implementation.

Adjacency matrix implementation cannot store:

Weighted edges

Data value at nodes

Adjacency matrix cannot store graphs with edge weights and node data