On 25 November 2011 05:13, Thomas DuBuisson wrote:
> My thinking on this was that something akin to NodeMap should be
> _part_ of the graph structure. This would be more convenient and
> allow the graph and nodemap operations to apply to a single data
> structure.
>
> Instead of:
>
> insMapNod
My thinking on this was that something akin to NodeMap should be
_part_ of the graph structure. This would be more convenient and
allow the graph and nodemap operations to apply to a single data
structure.
Instead of:
insMapNode_ :: (Ord a, DynGraph g) => NodeMap a -> a -> g a b -> g a b
Yo
On 24 November 2011 20:42, Ivan Lazar Miljenovic
wrote:
> On 24 November 2011 20:33, Thomas DuBuisson
> wrote:
>> All,
>>
>> The containers library has a somewhat primitive but certainly useful
>> Data.Graph library. Building a graph with this library simultaneously
>> results in the lookup fun
On 24 November 2011 20:33, Thomas DuBuisson wrote:
> All,
>
> The containers library has a somewhat primitive but certainly useful
> Data.Graph library. Building a graph with this library simultaneously
> results in the lookup functions:
>
> m1 :: Vertex -> (node, key, [key])
> m2 :: key -> M
All,
The containers library has a somewhat primitive but certainly useful
Data.Graph library. Building a graph with this library simultaneously
results in the lookup functions:
m1 :: Vertex -> (node, key, [key])
m2 :: key -> Maybe Vertex
(where 'key' is like FGL's 'label' but is assumed t
