OJ Board

Hi, Can any one help why RUNTIME ERROR: This is my code: #include <stdio.h> #include <string.h> #define MAX 100 int findRoot(char in[],char item) { int i; for(i = 0; i < strlen(in); i++) if(in[i] == item) return i; return 0; } void postfix(char pre[],int pre_low,char in[],int in_low,int in_up) { int...

Hi, Can any one help why RUNTIME ERROR: This is my code: #include <stdio.h> #include <string.h> #define MAX 100 int findRoot(char in[],char item) { int i; for(i = 0; i < strlen(in); i++) if(in[i] == item) return i; return 0; } void postfix(char pre[],int pre_low,char in[],int in_low,int in_up) { int...

Hi
Recently i got "Sedgewick" Graph part. This is a boss book for graph problem. And at last the Internet. For acm

practice!!
practice!!
practice!!


Do not forget about Baibel of the algorithm 'Coreman'.

Hi
Recently i got "Sedgewick" Graph part. This is a boss book for graph problem. And at last the Internet. For acm

practice!!
practice!!
practice!!


Do not forget about Baibel of the algorithm 'Coreman'.

I solved this problem. I use Floyed and dijkstra. In Floyed it got more time but in dijkstra it take 0.000 sec.

Ryan Pai

is absolutly right. It's the main thing. Euler path.

rafi7

may be ur problem in dijkstra or BMF. check this.

b3yours3lf u will edit this.

for(k=0;k<n;k++)
{
if(set[k]==set[e[j].v2])
set[k]=set[e[j].v1];
}

as

for(k=0;k<n;k++)
{
if(set[k]==set[e[j].v1)
set[k]=set[e[j].v2];
}

may be u will got AC

Ya i got the AC :D )) :) I use the Gabow's Algo in O(m) time to calculate the Strongly connectivity and in this algo i track the cross edge and forward edge. And count same thing as Bilash done for the back edge. I mind this is a great problem to know the Anatomy of DFS tree. I am not satisfied with...

I thing the second part of this problem is the main fact as 1)We can compute in E time (E is the number of edge) where is the graph is Strongly connected. Such as Kosaraju's algorithms, Tarjan Algorithms and Gabow's algorithms is enough. 2)If the algo return 1 then it's strongly connected becaz ther...

Is this Kernel DAG ?? [/url]