// by bell // Challenge Created by ChillPill, Galaxies far far away - Is it a tree? /* You work for a space-communications company and you are told that a network should be free of any loops. Otherwise loops will cause reverberation of the signal. You are given matrices that represent different networks of some spaceships in galaxies far far away. The matrices represent how the spaceships connect to each other(0 not connected, 1 is connected). The matrices are adjency matrices. The question is are there any loops in those networks? How many connections should be removed. Note: a tree graph is a graph with no loops. */ #include #include #include using namespace std; int main() { int m,mo=0,ms=0; bool line=false,li=true; vector>networks{ {0,1,0,1,0,1,0,1,0}, //no loops {0,1,1,1,0,1,1,1,0}, //loop {0,1,1,1,1,0,0,0,1,0,0,0,1,0,0,0}, //no loops {0,1,1,1,1,0,0,0,1,0,0,1,1,0,1,0}, //loop {0,0,1,1,0,0,0,0,1,0,0,1,1,0,1,0}, //loop, one node not connected {0,1,0,1,1,0,1,0,0,1,0,1,1,0,1,0} //loop, a cycle }; for(auto n=0;n

AdjacencyMatrixTree