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

- 140.8K All Categories
- 104.4K Programming Languages
- 6.4K Assembler Developer
- 1.8K Basic
- 39.8K C and C++
- 4.2K C#
- 7.9K Delphi and Kylix
- 4 Haskell
- 9.6K Java
- 4.1K Pascal
- 1.3K Perl
- 1.9K PHP
- 507 Python
- 48 Ruby
- 4.3K VB.NET
- 1.6K VBA
- 20.8K Visual Basic
- 2.6K Game programming
- 310 Console programming
- 88 DirectX Game dev
- 1 Minecraft
- 110 Newbie Game Programmers
- 2 Oculus Rift
- 8.9K Applications
- 1.8K Computer Graphics
- 726 Computer Hardware
- 3.4K Database & SQL
- 521 Electronics development
- 1.6K Matlab
- 627 Sound & Music
- 256 XML Development
- 3.3K Classifieds
- 192 Co-operative Projects
- 180 For sale
- 189 FreeLance Software City
- 1.9K Jobs Available
- 600 Jobs Wanted
- 201 Wanted
- 2.9K Microsoft .NET
- 1.7K ASP.NET
- 1.1K .NET General
- 3K Miscellaneous
- 3 Join the Team
- 0 User Profiles
- 349 Comments on this site
- 59 Computer Emulators
- 1.9K General programming
- 178 New programming languages
- 594 Off topic board
- 159 Mobile & Wireless
- 33 Android
- 124 Palm Pilot
- 335 Multimedia
- 151 Demo programming
- 184 MP3 programming
- 0 Bash scripts
- 18 Cloud Computing
- 52 FreeBSD
- 1.7K LINUX programming
- 367 MS-DOS
- 0 Shell scripting
- 320 Windows CE & Pocket PC
- 4.1K Windows programming
- 881 Software Development
- 405 Algorithms
- 68 Object Orientation
- 86 Project Management
- 88 Quality & Testing
- 233 Security
- 7.5K WEB-Development
- 1.8K Active Server Pages
- 61 AJAX
- 2 Bootstrap Themes
- 55 CGI Development
- 19 ColdFusion
- 222 Flash development
- 1.4K HTML & WEB-Design
- 1.4K Internet Development
- 2.2K JavaScript
- 33 JQuery
- 285 WEB Servers
- 119 WEB-Services / SOAP

jano_mano
Posts: **1**Member

in Algorithms

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 G whose edges are labeled with the distance between each pair of vertices they connect. Given two vertices a and b in G, and a distance n as input, write an algorithm in pseudo-code to find out if there is a path from a to b with cumulative distance less than n.

---------------------------------------------------

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

Thanks in advance

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 G whose edges are labeled with the distance between each pair of vertices they connect. Given two vertices a and b in G, and a distance n as input, write an algorithm in pseudo-code to find out if there is a path from a to b with cumulative distance less than n.

---------------------------------------------------

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

Thanks in advance

About & Contact / Terms of use / Privacy statement / Publisher: Lars Hagelin

Programmers Heaven articles / Programmers Heaven files / Programmers Heaven uploaded content / Programmers Heaven C Sharp ebook / Operated by CommunityHeaven LLC

© 1997-2013 Programmersheaven.com - All rights reserved.

## Comments

254Member ✭✭Go to the A labels. Visit each neighbour and label distance from A, A, and preceding node in the path to A. Go to the B labels and do the same. If the neighbour is already labelled with the other tag, sum the distances. If they are below N, there's your answer.

Terminate paths when distances go above N, or when you hit an already labelled node with a distance less than your distance.

Read my books

[link=http://www.lulu.com/bgy1mm] MiniBasic how to write a script interpreter [/link]

[link=http://www.lulu.com/bgy1mm] Basic Algorithms (in C) [/link]