Send Beginners mailing list submissions to
[email protected]
To subscribe or unsubscribe via the World Wide Web, visit
http://www.haskell.org/mailman/listinfo/beginners
or, via email, send a message with subject or body 'help' to
[email protected]
You can reach the person managing the list at
[email protected]
When replying, please edit your Subject line so it is more specific
than "Re: Contents of Beginners digest..."
Today's Topics:
1. kind of path search (Olivier Scalbert)
----------------------------------------------------------------------
Message: 1
Date: Tue, 15 Jan 2013 21:30:27 +0100
From: Olivier Scalbert <[email protected]>
Subject: [Haskell-beginners] kind of path search
To: [email protected]
Message-ID: <[email protected]>
Content-Type: text/plain; charset=ISO-8859-1; format=flowed
Hello,
I am a beginner in Haskell and in functional programming.
Here is the problem I want to solve with Haskell.
I am sure that this fascinating language can do it !!!!
Suppose I have N nodes: node1, node, ..., nodeN
At each node I have a subset of values taken from [v1, v2, ..., vk].
For exemple:
node1 : [v1, v3]
node2 : [v2, V5, v6]
node3 : [v2, v3]
I have also a directed graph. From a value you can go to other values.
v1 -> v5
v1 -> v6
v2 -> v1
v2 -> v2
v3 -> v2
v6 -> v2
Now, I want to get all the paths from node1, to nodeN, following the
node values and the graph.
node1.v1 -> node2.v6 -> node3.v2 is a path.
node1.v3 -> node2.v2 -> node3.v2 is also a path.
My problem size: N around 1000 and each node has 3 to 4 values taken
from [1..10].
Thanks for your help !!!
Olivier
------------------------------
_______________________________________________
Beginners mailing list
[email protected]
http://www.haskell.org/mailman/listinfo/beginners
End of Beginners Digest, Vol 55, Issue 16
*****************************************
