Search:

I am referring to the algorithm described in Wikipedia. Will the same following condition

if dist[i][j] > dist[i][k] + dist[k][j]
dist[i][j] = dist[i][k] + dist[k][j]

work for...

Thanks.

Why is it so that if I write


int temp = temp;

the value of temp is 0.

Can anyone please explain the output of the following code. I failed to explain myself.


#include <stdio.h>

#define SWAP(x,y) { int temp = x; printf("%d %d\n",x,y); x = y; printf("%d...

I am working on geometric algorithms. For my experiment demonstrations I would like to build some applet which would support dynamic functionalities. For example if I click some points in an area and...

Finally it seems to work from Code Blocks. We need to include the following flags.


-lCGAL -lgmp -frounding-math

Yes you are right.
I wish if you could help exactly on the linking. :(
Thanks though for helping so much.

Well, that is what I have tried and I got the above coded error messages. :)

I am trying with the following code.


#include <iostream>
#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
#include <CGAL/convex_hull_2.h>

typedef...

Thanks. I shall try! :)

Thanks. But how shall I browse and add the library in CodeBlocks.
I am confused about the path, name etc.

I would like to use CGAL from Code Blocks. I am using Ubuntu 12.04.
I have installed CGAL packages. Now how could I create a CGAL project.
Any help shall be greatly appreciated.

I have the following Prolog program.


male(jim).
male(pat).
male(bob).
female(alice).
female(diane).

single(jim).

Okay thanks a lot! Let me check out. :)

EDIT : Seen the links but could not make out somehow exactly how to make my program work! :(

I am getting no output from finalize function.


class A
{
public static int c = 5;
int i,j;

void showij()
{

In CLISP, how to detect whether an object is a string or not?

Yes exactly. I was trying to implement CFG in Lex which is very foolish to think about.

I am trying to implement one Lex program that accepts input of the following forms.


(NOT(NOT(NOT(P))))
(NOT(P))
(NOT(NOT(NOT(NOT(P)))))

And I wrote the following code.

Thanks it worked! :)

I am trying to implement a simple program in LEX but it is giving error.
I am doing it in Ubuntu.



%{
#include <stdio.h>
%}

digit [0-9]

In Reversi, at each step what can be the maximum number of moves possible? I want to implement Min-Max Tree.
Also, what would be the case if I want to implement NxN reversi.

I need help in choosing a topic for doing a AI term project. I have 20 days to work on. Can anyone please suggest topics to work on?

Any syntax help for implementing min heap please?
I am new to this and need to know the syntax.

I want to implement priority queue using STL.
Basically I want to use it for storing states(array of size k) sorted according cost.
Which standard template is useful for me?

I want to implement...

Why is that so? It would be helpful if you throw some light on this.



Thanks for helping! but read my previous question out carefully. The 2 questions are different.

I see! So you need proof for approach! Okay! Here it is..

I tried to solve it using XOR approach, from where I could not conclude anything fruitful.
Also, I cannot apply sorting as O(nlogn)...