Search:

And before you mention that there is no edge x0x3, I should say that the description of the problem doesn't point it out technically as an edge (hence the picture of the graph) but it does exist...

I see. Quite impressive that you chose distance of cities as an example as it is right this thing that I am working on.
I have a graph exactly as shown in this pdf (page 3):...

Noone can help me?

Hi to everyone!!! I have the following problem:
I have a directed graph and I want to find out whether there are any negative cycles using Bellman Ford algorithm. I know the weight of all of the...

Thank you very much for your help Zuk!!!!

You mean use realloc?? Give me an example please!!

Hi to everyone. I have a problem with populating a dynamic array I have. Although it seems that the variables of the Vertex are populated correctly, when I try an overall check (the last lines of the...

What do you mean "plus the larger from each subtree"?

I want to call quickselect (or partitioning) before the heapsort.

And the aim of all that is to change the complecity of the algorithm from nlogn to n+clogn.

What do you think? Am I stretching...

Question about sorting algorithms:

If I call quickselection function within heapsort algorithm, does that mean that the complexity will me smaller?

Anyone??

Hello to everyone..

I have made a function in order to add the values of the nodes on each path of the tree. For example if I enter numbers 7, 8, 9, 4, 1 then for the path (7>4>1) the cost must be...

At last!!!!!!
Now it works. Sorry if I tired you so. I admit reading the links you gave me rather quickly and may have missed some key points. I apologize for that. I really want to thank you for...

Disregard "i=0;"

Check this: circularly linked list . Why does it work for him and not for me? I took the code and modified the variable names, added the one about word and read it.

Mine keeps giving me error...

Treat me like a kid please. I guess I need it spelled out.

1. So I should malloc "first"?
2. What should i return in that piece of code?

1. I added the mallocing error check.
2.
How can I make sure that first is really added?
3. I haved a printf("test") in order to see if addnode is called. It never gets printed so I guess...

!!!!
I got only 2 warnings whenever I compiled. I use wx-Dev-C++. Maybe that's because I don't get all these warnings? Or are they turned off? I can't find any settings.

How do I turn them on?
...

1. Did it.
2. I am looking it up right now.
3. What do you mean?
4. Theoretically I get it but practically...
5. When I use char *letter it runs but leads to the error message (The circularly...

Guys, don't even ask!! I am trying to complete a course. So far I have managed to get by regarding C. But now with malloc and linked lists, I am way over my head. What I would really appreciate is a...

I have isolated the problem to the part )if (list==NULL). I realize that I can't get to fill the first node of the list. But why? Please consider that you are talking to a C illiterate. :)

What...

What should I do about these things mentioned above?

I must be so inexperienced or so "bad" at C that I still don't understand what I must do in order to get the list to fill itself with what I want. Please show me the way!!

Btw, I totally get the...

Thx for your reply but I have to admit that although i see your point, I can't exactly make it happen. Please consider that I have been essentially working on C for about one month (and not that...

I want to make a circularly linked list taking data from a text file.
It keeps saying that my list is Empty when i try to print it. Is it really empty or is something wrong with the printlist...