Posts in tag

Leal


Consider a graph with weights on its edges. Like the one in the figure, for example. One way to represent this graph is via an adjacency matrix A whose component A(s, t) is the weight of the edge between nodes s and t. Notice that since there may not be edges between all vertices (after …