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. In this lab, you will write a function to test
whether or not a graph (based on an adjacency matrix) is complete.
- Start by downloading complete.cpp which is a
graph class based on an adjacency matrix.
- This file has an empty function called complete.
- Fill in this function so that it tests the graph to check if it is complete
or not and returns a boolean.
- The main function tests this function on a graph that is complete and one
that is not.
When you're done, email the code to email@example.com.
Copyright © 2018 Ian Finlayson | Licensed under a Creative Commons Attribution 4.0 International License.