Let G be a graph with six vertices, v1, v2, v3, v4,v5, v6, and seven edges. Let B be the 7 x 2 edge matrix(adjacency list) of G. (Recall that each row of B denotes an edgeof G, e.g. the row (3, 4) would denote the edge {v3, v4}.)Write a program or an algorithms (using pseudocode) which printsthe degree of each vertex of G.
Test the program:
B = 1 2
1 4
1 6
5 3
2 4
2 6
4 6
You can use MS Visual Studio to write C++ program, Java, Python orpseudocode.
Expert Answer
An answer will be send to you shortly. . . .
OR
PayPal Gateway not configured
OR
PayPal Gateway not configured