| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
IGraph.Internal.Graph
Synopsis
- newtype IGraph = IGraph (ForeignPtr IGraph)
- withIGraph :: IGraph -> (Ptr IGraph -> IO b) -> IO b
- igraphNew' :: Int -> Bool -> IO IGraph
- igraphCopy :: IGraph -> IO IGraph
- igraphNew :: Int -> Bool -> HasInit -> IO IGraph
- igraphVcount :: IGraph -> IO Int
- igraphEcount :: IGraph -> IO Int
- igraphGetEid :: IGraph -> Int -> Int -> Bool -> Bool -> IO Int
- igraphEdge :: IGraph -> Int -> IO (Int, Int)
- igraphAddVertices :: IGraph -> Int -> Ptr () -> IO ()
- igraphAddEdge :: IGraph -> Int -> Int -> IO ()
- igraphAddEdges :: IGraph -> Vector -> Ptr () -> IO ()
- igraphFull :: Int -> Bool -> Bool -> IO IGraph
- igraphErdosRenyiGame :: ErdosRenyi -> Int -> Double -> Bool -> Bool -> IO IGraph
- igraphDegreeSequenceGame :: Vector -> Vector -> Degseq -> IO IGraph
- igraphRewire :: IGraph -> Int -> Rewiring -> IO Int
- igraphIsoclassCreate :: Int -> Int -> Bool -> IO IGraph
- igraph_destroy :: FinalizerPtr IGraph
- igraphNew''_ :: Ptr IGraph -> CInt -> CInt -> IO CInt
- igraphCopy'_ :: Ptr IGraph -> Ptr IGraph -> IO CInt
- igraphVcount'_ :: Ptr IGraph -> IO CInt
- igraphEcount'_ :: Ptr IGraph -> IO CInt
- igraphGetEid'_ :: Ptr IGraph -> Ptr CInt -> CInt -> CInt -> CInt -> CInt -> IO CInt
- igraphEdge'_ :: Ptr IGraph -> CInt -> Ptr CInt -> Ptr CInt -> IO CInt
- igraphAddVertices'_ :: Ptr IGraph -> CInt -> Ptr () -> IO CInt
- igraphAddEdge'_ :: Ptr IGraph -> CInt -> CInt -> IO CInt
- igraphAddEdges'_ :: Ptr IGraph -> Ptr Vector -> Ptr () -> IO CInt
- igraphFull'_ :: Ptr IGraph -> CInt -> CInt -> CInt -> IO CInt
- igraphErdosRenyiGame'_ :: Ptr IGraph -> CInt -> CInt -> CDouble -> CInt -> CInt -> IO CInt
- igraphDegreeSequenceGame'_ :: Ptr IGraph -> Ptr Vector -> Ptr Vector -> CInt -> IO CInt
- igraphRewire'_ :: Ptr IGraph -> CInt -> CInt -> IO CInt
- igraphIsoclassCreate'_ :: Ptr IGraph -> CInt -> CInt -> CInt -> IO CInt
Documentation
igraphNew :: Int -> Bool -> HasInit -> IO IGraph Source #
Create a igraph object and attach a finalizer
Arguments
| :: IGraph | The graph to which the edges will be added. |
| -> Vector | The edges themselves. |
| -> Ptr () | The attributes of the new edges. |
| -> IO () |
The edges are given in a vector, the first two elements define the first edge (the order is from , to for directed graphs). The vector should contain even number of integer numbers between zero and the number of vertices in the graph minus one (inclusive). If you also want to add new vertices, call igraph_add_vertices() first.
igraphErdosRenyiGame :: ErdosRenyi -> Int -> Double -> Bool -> Bool -> IO IGraph Source #