delphi programming forums mysql charset mget recursive synonimos
free ventrilo servers hosting cs javascript delay python find in list
Back Forum New
abstract:

Can somebody tell me what I'm doing wrong since its not working but just highlighting the first line in red.
Very much appricate help & some explanation.
thks
Mike


Hi,
I'm new on delphi & I'm trying to do a simple program realted to the depth-first Search.
procedure Dfs( V : Vertex );
begin
        Visited[ V ] := true;
        for Each W Adjacent to V do
                if not Visited[ W ] then
                        Dfs( W );
end;
end.
Can somebody tell me what I'm doing wrong since its not working but just highlighting the first line in red.
Very much appricate help & some explanation.
thks
Mike
Author Hot threads

TOP

What are you trying to achieve and can you post more code?

TOP


Originally Posted by Chris_H
What are you trying to achieve and can you post more code?
What i'm trying to achieve is to describe algorithm for the depth-first search on a  given connected simple graph & to have a small program written proving the graph.
As to post more code, I'm still a beginner in this matter & what I'm learning is from books.
Would like to have me help pls if possible.
Thks

TOP

Post Last Edited by delphidev2010 at 2010-5-27 08:11

the code you have in there is from vb6. do you have to create a tree or graph to search in your code? or just the search code? and are you familiar with the algorithm? if it's a parent node with child nodes tree structure then you have to do a record pointer in delphi.



Can somebody tell me what I'm doing wrong since its not working but just highlighting the first line in red.
Very much appricate help & some explanation.
thks
Mike

TOP

Back Forum