Howdy, Stranger!

It looks like you're new here. If you want to get involved, click one of these buttons!

Categories

Welcome to the new platform of Programmer's Heaven! We apologize for the inconvenience caused, if you visited us from a broken link of the previous version. The main reason to move to a new platform is to provide more effective and collaborative experience to you all. Please feel free to experience the new platform and use its exciting features. Contact us for any issue that you need to get clarified. We are more than happy to help you.

Very urgent help .... regarding Pseudo code for graphs related problem

kashnexkashnex Posts: 1Member
Hi everyone!

I would appreciate if I can be given some help to solve thus riddle (my project task) to find out the solution. I really need the pseudo code for this which fully solve this problem. I am really dying to solve this problem as I have been working for last two months to solve this but can't get the answer to this.


PROBLEM
---------------------------------------------------
Assuming you have a graph [italic]G[/italic] whose edges are labeled with the distance between each pair of vertices they connect. Given two vertices [italic]a[/italic] and [italic]b[/italic] in[italic] G[/italic], and a distance [italic]n[/italic] as input, write an algorithm in pseudo-code to find out if there is a path from [italic]a[/italic] to [italic]b[/italic] with cumulative distance less than [italic]n[/italic].
---------------------------------------------------

I will be very much thankful for any help in this regards

Regards
Kashi
Sign In or Register to comment.