Undirected Graphs

[jmatsushita]

Hi there,

I started working on porting the Undirected module from alga but with some failing tests for now. and the tests pass now.

Probably quite inefficient but it's a start :)

Cheers,

Jun

--

UPDATE:

Here are some things to continue working on before merging:

• Write tests for each undirected module functions
  • Fix edgeCount,...
• Import docs from alga
• Implement Algebra.Graph.AdjacencyMap.Undirected (following this comment from alga

[thomashoneyman]

Sorry, didn’t mean to mark this ready to review 😅 thanks for adding this!

To be honest I wrote the core of this in a few hours and haven’t looked at it since (it’s also unpublished), so if you are interested in implementing the library and don’t want to have to wait on me please feel free to take the code here and build on it in your own library. Otherwise I’m happy to review and merge things here!

[jmatsushita]

Hi Thomas, thanks a lot. I'd be quite happy to have your feedback as I make progress with my exploration of the library and hopefully succeeding in implementing a Comonad instance for it as I did for learning purposes in fgl here https://github.com/amhuppert/purescript-fgl/pull/1/files

[jmatsushita]

I think undirected graphs work now. Had to implement a probably very inefficient Set.cartesianProduct and only implemented what I needed for simple tests.

Can I suggest to review this first and then maybe do a docs PR (basically pasting the docs from alga) and it would be nice to maybe have it on Pursuit then (if its possible these days?).

Cheers,

Jun