Implementing Graph Algorithms in Pascal

Observer · Post by **Observer** » Thu May 15, 2003 4:05 pm

I'm trying to learn some graph algorithms at home.

However, I'm facing a number of difficulties:
1. Hard to find related Pascal resources from the Web/ library
2. Don't know where to start with
E.g. how can I implement Dijkstra's Algorithm in Pascal
and are there any good ACM-problems for me to have some practice?

Please help!!! All assistance are strongly welcomed.

junjieliang · Post by **junjieliang** » Sat May 17, 2003 2:59 pm

Firstly, algorithms are largely not linked to language. The more important thing is to know about the graph theory behind the program, and after that you can implement it in just about any language.

One URL that helped me greatly when I first started: http://ciips.ee.uwa.edu.au/~morris/Year ... s_ToC.html

Altternatively, you can search on Google for more information.

Hope this helps.

Observer · Post by **Observer** » Sun May 18, 2003 8:45 am

Thanks!

Well actually, language DOES matter......

You see, most websites apply C++ codes to their explanation of algorithms. This gives me great trouble ('cos I know nothing about C++/C/JAVA......

)