i am george.i have to do 2 exercises in c/c++ and i dont know a lot of programming.the exercises are:

1) code for depth first search with adjacency list for every graph

2)code for Dijkstra algorithm with weight graph

if somebody knows something(code,links,etc...) that could help me please contact me.

thanks a lot

george 22_jk

9 Years
Discussion Span
Last Post by Salem

George, nobody is going to do u'r homework. Please read the form rules before asking question. It would be more better if u could show us what have u got so far.

Do u know how the Depth First Search algorithm works. It very important u understand the algorithm before u u do anything. I have coded this is LISP, its much simplier in LISP rather than C.

I would suggest u to first go and understand the Depth First Search first.



ssharish, could you please go all the way and use complete English words rather than chatty abbreviations? There's no reason to use "u" instead of "you". Those who don't have English as their native language or aren't familiar with chat speak will have an easier time following your posts, and you'll seem more professional, which adds to your credibility.


Three shall be the number thou shalt count, and the number of the counting shall be three. Four shalt thou not count, neither count thou two, excepting that thou then proceed to three. Five is right out.
More broadcast buffoonery from some dolt who thinks a widespread question will get better answers.
No sirree, just a face full of telling you to DYOFH.

I'm just waiting to see how many other forums you're going to infest.

This article has been dead for over six months. Start a new discussion instead.
Have something to contribute to this discussion? Please be thoughtful, detailed and courteous, and be sure to adhere to our posting rules.