February 2020
Beginner to intermediate
616 pages
15h 16m
English
We refer to the same graph that was in the previous recipe; however, this time, there are no edges:

Its adjacency matrix representation is as follows:
5,5 1 2 3 4 5----------------------------------------------------------------------------1 0 1 1 0 12 1 0 0 1 13 1 0 0 1 14 0 1 1 0 15 1 1 1 1 0
The only difference between the programs of the directed and undirected graphs is that, in the latter, the edge is simply repeated. That is, if there is an edge between a and b, then it is considered to be two edges: one from a to b and the other from b to a.
The program for creating an adjacency matrix representation of ...
Read now
Unlock full access