int main(int argc, char* argv[])
{
testMath();
testGraph();
testNavi();
return 0;
}
void recurGraph(byte *g) {
int res,i,j;
byte buf[W*H];
res=complete(g);
if(res==-1) return;
if(res==1) {
if(isMin(g)) {
outGraph(g);
testGraph(g);
printf("ok\n");
return;
}//if
}//if
for(i=0; i<H*W; i++) {
for(j=0; j<4; j++) {
if((g[i]&(1<<j))&&(g[i]&(16<<j))) {
copy(g,buf);
buf[i]-=(1<<j);
recurGraph(buf);
copy(g,buf);
buf[i]-=(16<<j);
recurGraph(buf);
return;
}//if
}//for
}//for
}//recurGraph
int main( int argc, char *argv[] ) {
testInitialMoves();
testBlank();
testMovesRound1();
testGraph();
return EXIT_SUCCESS;
}
/*main written by Josh Cristol and Cody Horton*/
int main(void){
PLL_Init();
Output_Init();
Edge_Init();
while(1){
while(!Switch_Pressed()){wait(1);}
wait(0);
testBinary();
while(!Switch_Pressed()){wait(1);}
wait(0);
testDec();
while(!Switch_Pressed()){wait(1);}
wait(0);
testGraph();
XYplotInit("Graph", getXMin(), getXMax(), getYMin(), getYMax());
int32_t* xBuff = getXData();
int32_t* yBuff = getYData();
XYplot(xBuff, yBuff, getLength());
}
}
int main(){
Graph testGraph("Graph.txt");
//testGraph.initialize("Graph.txt");
testGraph.printGraph();
//testGraph.printMatrix();
//testGraph.breadthFirst(testGraph.startNode);
testGraph.graveyard('P');
//testGraph.dijstra();
//testGraph.prim();
//testGraph.kruskal();
//testGraph.testPath('P');
return 0;
}
int main(){
testGraph();
std::cin.ignore();
return 0;
}
int main(){
testGraph();
return 0;
}
