Home CPSC 340

Graphs Exercise

Objective

To gain experience with graphs.

Task

Recall that a complete graph is one in which every node is connected to every other node by an edge. In this lab, you will write a function to test whether or not a graph (based on an adjacency matrix) is complete.


Details


Submitting

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

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