Search found 1 match
- Fri Jun 05, 2009 11:28 am
- Forum: Volume 4 (400-499)
- Topic: 459 - Graph Connectivity
- Replies: 132
- Views: 25843
Re: 459 - Graph Connectivity
hi, i used bfs to solve this problem. i dont know why this code is getting RTE!!! plz help me .. here is my code: #include <iostream> #include <cstring> #include <queue> using namespace std; #define MAX 26 int adj[MAX][MAX]; int color[MAX]; int maximum; void init(void) { int i,j; for(i=0;i<MAX;i++) ...