The two main structures for storing a static graph are the adjacency matrix and the adjacency list. For a network of n nodes, an adjacency matrix requires O(n2) space complexity and is thus generally used only for small networks. Adjacency lists are typically used instead in many network anal...
It looks like the adjacency matrix cannot be multiplied by itself because it is a sparse tensor as opposed to when the edge weights aren't given and are given a one for all edges. Changing the tensor multiplication function used here should fix the issue, but I still haven't managed to ...
A connectivity matrix is usually a list of which vertex numbers have an edge between them. Adjacency matrixes are easier to compute certain kinds of algorithms over, but may require more storage than a connectivity matrix (especially if the vertex degrees are low.) Either kind of matrix can be...