Home CPSC 340

Graphs Exercise



To gain experience with graphs.



Recall that a complete graph is one in which every node is connected to every other node by an edge, like this:

The 5 nodes in this graph each have a line to the the other 4 nodes
in the graph.

In this lab, you will write a function to test whether or not a graph (based on an adjacency matrix) is complete.





When you're done, email the code to ifinlay@umw.edu.

Copyright © 2019 Ian Finlayson | Licensed under a Creative Commons Attribution 4.0 International License.