![Hi All!
I have a question regrading creating a subgraph or rather verifying that a connected or
unconnected graph has a connected or unconnected subgraph. I have a territory object, and each
of these objects have adjacent territories in the form of a string vector. Moreover, these territory
objects also have strin continent attached (every territory belongs to one and only one continent).
Is there a way in C++ to check to see if the contients for a connected subgraph? This is the code
I currently have running to check to see if that graph is connected, I wanted to know if there was
a way to check if the subgraphs are connected.
//walk function will traverse the map. This will be a recursive function to walk along the array
void Map::walk(int visit, bool visited[]){
visited[visit] = true;
for(int i = 0; i< vertCount; i++){
if(adjacencyMatrix[visit][i] == 1){
if(!visited[visit]){
walk(i, visited);
}
}
}
}
//verify if an edge is connected in a graph
bool Map::validate(){
bool connectedGraph=false;
bool connectedSubGraph=false;
bool notUniqueContinent = true;
bool* verifyArr = new bool[vertCount];
//the idea here is we will start at i=o, then traverse and check as we go along whether or not all
nodes are visble
for(int i=0; i](https://image.slidesharecdn.com/hiallihaveaquestionregradingcreatingasubgraphorratherv-231006123426-8a43df09/85/Hi-All-I-have-a-question-regrading-creating-a-subgraph-or-rather-v-pdf-1-320.jpg)
Hi All!I have a question regrading creating a subgraph or rather v.pdf
- 1. Hi All! I have a question regrading creating a subgraph or rather verifying that a connected or unconnected graph has a connected or unconnected subgraph. I have a territory object, and each of these objects have adjacent territories in the form of a string vector. Moreover, these territory objects also have strin continent attached (every territory belongs to one and only one continent). Is there a way in C++ to check to see if the contients for a connected subgraph? This is the code I currently have running to check to see if that graph is connected, I wanted to know if there was a way to check if the subgraphs are connected. //walk function will traverse the map. This will be a recursive function to walk along the array void Map::walk(int visit, bool visited[]){ visited[visit] = true; for(int i = 0; i< vertCount; i++){ if(adjacencyMatrix[visit][i] == 1){ if(!visited[visit]){ walk(i, visited); } } } } //verify if an edge is connected in a graph bool Map::validate(){ bool connectedGraph=false; bool connectedSubGraph=false; bool notUniqueContinent = true; bool* verifyArr = new bool[vertCount]; //the idea here is we will start at i=o, then traverse and check as we go along whether or not all nodes are visble for(int i=0; i