51 Listing Edges 5 Points Write O Na Program Whose Input Adjacency Matrix Graph G Program Q43815586
in python or java
5.1 Listing all the edges (5 points) Write an O(na) program whose input is the adjacency matrix of a graph G. The program should print the list of all the edges (without repetition). For example, if the vertices of the graph are 0, 1, 2, 3, 4, 5 with 0 adjacent to 1 and 5, 1 adjacent to 5 2 adjacent to 3 and 4 and 3 adjacent to 4 then the printed list should be something like. W NNOO 5.1 Listing all the edges (5 points) Write an O(na) program whose input is the adjacency matrix of a graph G. The program should print the list of all the edges (without repetition). For example, if the vertices of the graph are 0, 1, 2, 3, 4, 5 with 0 adjacent to 1 and 5, 1 adjacent to 5 2 adjacent to 3 and 4 and 3 adjacent to 4 then the printed list should be something like. W NNOO 5.1 Listing all the edges (5 points) Write an O(na) program whose input is the adjacency matrix of a graph G. The program should print the list of all the edges (without repetition). For example, if the vertices of the graph are 0, 1, 2, 3, 4, 5 with 0 adjacent to 1 and 5, 1 adjacent to 5 2 adjacent to 3 and 4 and 3 adjacent to 4 then the printed list should be something like. W NNOO Show transcribed image text 5.1 Listing all the edges (5 points) Write an O(na) program whose input is the adjacency matrix of a graph G. The program should print the list of all the edges (without repetition). For example, if the vertices of the graph are 0, 1, 2, 3, 4, 5 with 0 adjacent to 1 and 5, 1 adjacent to 5 2 adjacent to 3 and 4 and 3 adjacent to 4 then the printed list should be something like. W NNOO
5.1 Listing all the edges (5 points) Write an O(na) program whose input is the adjacency matrix of a graph G. The program should print the list of all the edges (without repetition). For example, if the vertices of the graph are 0, 1, 2, 3, 4, 5 with 0 adjacent to 1 and 5, 1 adjacent to 5 2 adjacent to 3 and 4 and 3 adjacent to 4 then the printed list should be something like. W NNOO
5.1 Listing all the edges (5 points) Write an O(na) program whose input is the adjacency matrix of a graph G. The program should print the list of all the edges (without repetition). For example, if the vertices of the graph are 0, 1, 2, 3, 4, 5 with 0 adjacent to 1 and 5, 1 adjacent to 5 2 adjacent to 3 and 4 and 3 adjacent to 4 then the printed list should be something like. W NNOO
Expert Answer
Answer to 5.1 Listing all the edges (5 points) Write an O(na) program whose input is the adjacency matrix of a graph G. The progra…
OR