j/4600-project-2
1
1
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Knotted should work now. I really was over-complicating it. I have commented the code and removed unused includes from the file.

Browse Source
This commit is contained in:
mal0420
2022-04-28 21:09:37 -05:00
parent a05e4e19c0
commit 13ed587ceb
4 changed files with 53 additions and 101 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
inc/graph.hpp
View File

@@ -2,8 +2,9 @@
#ifndef PROJECT2_INC_GRAPH_HPP
#define PROJECT2_INC_GRAPH_HPP
#include <string> // string
#include <vector> // vector<int>, vector<vector<int>
#include <set> // set<int>.find()
#include <string> // string -- not used?
#include <vector> // vector<int>, vector<vector<int>
typedef std::vector<std::vector<int>> matrix;
@@ -26,11 +27,14 @@ class graph {
// is the graph...
bool reducible (); // ?
bool knotted (); // ?
// miscellaneous functions:
// print the graph
void print ();
bool DFS( int node, std::set<int>&visited, int parent );
bool detectKnot();
private:
int num_processes = 0;
int num_resources = 0;
@@ -38,4 +42,4 @@ class graph {
matrix m; // Tell me, Mr. Anderson, what good is a phone call if you are unable to speak?
};
#endif // PROJECT2_INC_GRAPH_HPP
#endif // PROJECT2_INC_GRAPH_HPP