How can I represent weighted graph in scheme with alist?

Question

1.22/5 (2 votes)

See more: (untagged)

Hi,
I have to represent a (weighted,directed) graph with association-list with keys - vertices of the graph? How can I find the shortest and the "cheapest" path in the graph using BFS algorithm and Dijkstra's algorithm. Can someone help me?
Thank you

Posted 4-Jan-14 5:37am

Member 10503326

Updated 5-Jan-14 0:21am

v2

Add a Solution

Comments

Nelek 4-Jan-14 13:11pm

Yes... here there are a lot of people that can help. But first... You should explain a problem. As it is, your "question" would mean: Please do my work for me.

1 solution

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Nelek · Answer 1 · 2014-01-04T07:17:00

As a start point: Google

Search BFS[^] bring among others following interesting links:
http://en.wikipedia.org/wiki/Breadth-first_search[^]
http://www.princeton.edu/~achaney/tmve/wiki100k/docs/Breadth-first_search.html[^]
http://www.ics.uci.edu/~eppstein/161/960215.html[^]
ans some videos in Youtube

Search Dijkstra's[^]
http://en.wikipedia.org/wiki/Dijkstra's_algorithm[^]
http://optlab-server.sce.carleton.ca/POAnimations2007/DijkstrasAlgo.html[^]
and some videos in youtube too

Now you have a start point, read the information, investigate a bit more and feel free to come back when you have questions or problems, but don't forget this is the Quick Answers section. It is better and you get faster help if you make 10 concrete questions about concrete problems, than a big question about a "how-to guide"
As addition and for more successfully questions in the future I recommend you to read:
What have you tried?[^]