v0.7.0

ChangeLog.md

 Revision history for haskell-igraph
 ===================================
 
-v0.7.0 --
------------
+v0.7.0 -- 2018-05-23
+--------------------
 
 * Add more functions and tests.
 * Internal interface redesign.

src/IGraph/Algorithms/Structure.chs

 {-# LANGUAGE ForeignFunctionInterface #-}
+{-# LANGUAGE DataKinds #-}
 module IGraph.Algorithms.Structure
     ( -- * Shortest Path Related Functions
       getShortestPath
@@ -75,7 +76,8 @@ isConnected gr = igraphIsConnected (_graph gr) IgraphWeak
 
 isStronglyConnected :: Graph 'D v e -> Bool
 isStronglyConnected gr = igraphIsConnected (_graph gr) IgraphStrong
-{#fun igraph_is_connected as ^
+
+{#fun pure igraph_is_connected as ^
     { `IGraph'
     , alloca- `Bool' peekBool*
     , `Connectedness'

src/IGraph/Mutable.hs

@@ -141,7 +141,7 @@ setEdgeAttr edgeId x gr = unsafePrimToPrim $
 -- | Removes loop and/or multiple edges from the graph.
 simplify :: Bool   -- ^ If true, multiple edges will be removed.
          -> Bool   -- ^ If true, loops (self edges) will be removed.
-         ->
+         -> ([e] -> e)   -- ^ Edge c
          -> Graph d v e -> Graph d v e
 simplify delMul delLoop fun gr = do
 -}

tests/Test/Basic.hs

@@ -20,6 +20,7 @@ tests = testGroup "Basic tests"
     [ graphCreation
     , graphCreationLabeled
     , graphEdit
+    , nonSimpleGraphTest
     ]
 
 graphCreation :: TestTree
@@ -69,3 +70,15 @@ graphEdit = testGroup "Graph editing"
         freeze g
     getEdges gr = map
         (\(a,b) -> ((nodeLab gr a, nodeLab gr b), edgeLab gr (a,b))) $ edges gr
+
+nonSimpleGraphTest :: TestTree
+nonSimpleGraphTest = testGroup "loops, multiple edges"
+    [ testCase "case 1" $ es @=? labEdges gr
+    ]
+  where
+    es = [ ((0,1), 'a')
+         , ((1,2), 'b')
+         , ((1,2), 'c')
+         , ((0,2), 'd') ]
+    gr :: Graph 'U Int Char
+    gr = mkGraph [0,1,2] es