[Haskell-cafe] Array and Ix for custom Graph ADT

[Mark Spezzano]

Hi Antoine,

The first Int field is a unique index, beginning at 1 and increasing by 1 for each unique Node. The second [Int] field is just a list of random numbers associated with that node.

Mark


On 14/08/2011, at 2:13 AM, Antoine Latter wrote:

> On Sat, Aug 13, 2011 at 4:37 AM, Mark Spezzano
> <mark.spezzano at chariot.net.au> wrote:
>> Hi,
>> 
>> I'm creating a Graph data structure, and I want to use the array list approach, implemented as an Array.
>> 
>> I need my Nodes to be instances of Ix for this to work and my Node type is roughly as follows:
>> 
>> data Node = MyNode Int [Int] Type1 Type2
>> 
>> (Type1 and Type2 are nullary algebraic datatypes--enumerations in other words)
>> 
>> How can I "index" the Array with an instance of a Node. I think I need to make Node an instance of Ix somehow??
>> 
> 
> What do the 'Int' and '[Int]' fields represent in your Node type?
> 
> Antoine
> 
>> Is this a sensible approach? Sample code of the instance declaration for Ix would be helpful.
>> 
>> 
>> Thanks
>> 
>> Mark Spezzano
>> 
>> _______________________________________________
>> Haskell-Cafe mailing list
>> Haskell-Cafe at haskell.org
>> http://www.haskell.org/mailman/listinfo/haskell-cafe
>> 
> 
> _______________________________________________
> Haskell-Cafe mailing list
> Haskell-Cafe at haskell.org
> http://www.haskell.org/mailman/listinfo/haskell-cafe
> 
>