Search found 9 matches

by Grinder
Wed Jan 14, 2004 4:58 pm
Forum: Volume 5 (500-599)
Topic: 536 - Tree Recovery
Replies: 19
Views: 8206

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...
by Grinder
Wed Jan 14, 2004 4:57 pm
Forum: Volume 5 (500-599)
Topic: 536 - Tree Recovery
Replies: 19
Views: 8206

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...
by Grinder
Fri Dec 26, 2003 11:19 pm
Forum: Algorithms
Topic: Algorithm Books
Replies: 19
Views: 5850

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'.

:D
by Grinder
Fri Dec 26, 2003 11:16 pm
Forum: Algorithms
Topic: Algorithm Books
Replies: 19
Views: 5850

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'.

:D
by Grinder
Sat Nov 08, 2003 7:06 am
Forum: Volume 1 (100-199)
Topic: 117 - The Postal Worker Rings Once
Replies: 58
Views: 16357

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.

:)
by Grinder
Sat Oct 25, 2003 2:43 pm
Forum: Volume 100 (10000-10099)
Topic: 10034 - Freckles
Replies: 101
Views: 32408

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 :D
by Grinder
Wed Oct 22, 2003 2:48 pm
Forum: Volume 105 (10500-10599)
Topic: 10510 - Cactus
Replies: 31
Views: 22706

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...
by Grinder
Sat Oct 18, 2003 12:36 pm
Forum: Volume 105 (10500-10599)
Topic: 10510 - Cactus
Replies: 31
Views: 22706

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...
by Grinder
Fri Oct 17, 2003 4:27 pm
Forum: Volume 105 (10500-10599)
Topic: 10510 - Cactus
Replies: 31
Views: 22706

10510Cactus

Is this Kernel DAG ?? :o [/url]

Go to advanced search