Safe Haskell | None |
---|---|
Language | Haskell2010 |
Synopsis
- module IGraph.Internal.Types
- igraphVectorNew :: Int -> IO Vector
- fromList :: [Double] -> IO Vector
- toList :: Vector -> IO [Double]
- igraphVectorNull :: Vector -> IO ()
- igraphVectorFill :: Vector -> Double -> IO ()
- igraphVectorE :: Vector -> Int -> Double
- igraphVectorSet :: Vector -> Int -> Double -> IO ()
- igraphVectorTail :: Vector -> Double
- igraphVectorSize :: Vector -> IO Int
- igraphVectorCopyTo :: Vector -> Ptr CDouble -> IO ()
- igraphVectorPtrNew :: Int -> IO VectorPtr
- fromPtrs :: [Ptr ()] -> IO VectorPtr
- toLists :: VectorPtr -> IO [[Double]]
- igraphStrvectorNew :: Int -> IO StrVector
- igraphStrvectorGet :: StrVector -> Int -> IO String
- toStrVector :: [ByteString] -> IO StrVector
- asBS :: ByteString -> (Ptr BSLen -> IO a) -> IO a
- bsToByteString :: Ptr BSLen -> IO ByteString
- bsvectorNew :: Int -> IO BSVector
- bsvectorSet :: BSVector -> Int -> ByteString -> IO ()
- toBSVector :: [ByteString] -> IO BSVector
- igraphMatrixNew :: Int -> Int -> IO Matrix
- igraphMatrixNull :: Matrix -> IO ()
- igraphMatrixFill :: Matrix -> Double -> IO ()
- igraphMatrixE :: Matrix -> Int -> Int -> IO Double
- igraphMatrixSet :: Matrix -> Int -> Int -> Double -> IO ()
- igraphMatrixCopyTo :: Matrix -> Ptr CDouble -> IO ()
- igraphMatrixNrow :: Matrix -> IO Int
- igraphMatrixNcol :: Matrix -> IO Int
- fromRowLists :: [[Double]] -> IO Matrix
- toRowLists :: Matrix -> IO [[Double]]
- toColumnLists :: Matrix -> IO [[Double]]
- igraphVsAll :: IO IGraphVs
- igraphVsAdj :: Int -> Neimode -> IO IGraphVs
- igraphVsVector :: Vector -> IO IGraphVs
- igraphVitNew :: IGraph -> IGraphVs -> IO IGraphVit
- vitToList :: IGraphVit -> IO [Int]
- igraphEsAll :: EdgeOrderType -> IO IGraphEs
- igraphEsVector :: Vector -> IO IGraphEs
- igraphEitNew :: IGraph -> IGraphEs -> IO IGraphEit
- eitToList :: IGraphEit -> IO [Int]
- igraphNew :: Int -> Bool -> HasInit -> IO IGraph
- igraphCopy :: IGraph -> 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 ()
- igraphDeleteVertices :: IGraph -> IGraphVs -> IO Int
- igraphDeleteEdges :: IGraph -> IGraphEs -> IO Int
- withAttr :: String -> BSVector -> (Ptr AttributeRecord -> IO a) -> IO a
- igraphHaskellAttributeHasAttr :: IGraph -> AttributeElemtype -> String -> IO Bool
- igraphHaskellAttributeGANSet :: IGraph -> String -> Double -> IO Int
- igraphHaskellAttributeGAN :: IGraph -> String -> IO Double
- igraphHaskellAttributeVAS :: IGraph -> String -> Int -> IO (Ptr BSLen)
- igraphHaskellAttributeEAN :: IGraph -> String -> Int -> IO Double
- igraphHaskellAttributeEAS :: IGraph -> String -> Int -> IO (Ptr BSLen)
- igraphHaskellAttributeEASSetv :: IGraph -> String -> BSVector -> IO Int
- igraphHaskellAttributeVASSet :: IGraph -> String -> Int -> Ptr BSLen -> IO Int
- igraphHaskellAttributeEASSet :: IGraph -> String -> Int -> Ptr BSLen -> IO Int
Documentation
module IGraph.Internal.Types
Vector type and basic operations
igraphVectorNull :: Vector -> IO () Source #
igraphVectorTail :: Vector -> Double Source #
Pointer vector
String vector
toStrVector :: [ByteString] -> IO StrVector Source #
Bytestring
bsToByteString :: Ptr BSLen -> IO ByteString Source #
Bytestring vector
bsvectorSet :: BSVector -> Int -> ByteString -> IO () Source #
toBSVector :: [ByteString] -> IO BSVector Source #
Igraph matrix type
igraphMatrixNull :: Matrix -> IO () Source #
Igraph vertex selector
igraphVsAll :: IO IGraphVs Source #
Igraph vertex iterator
Igraph edge Selector
igraphEsAll :: EdgeOrderType -> IO IGraphEs Source #
Igraph edge iterator
IGraph type and basic operations
igraphNew :: Int -> Bool -> HasInit -> IO IGraph Source #
Create a igraph object and attach a finalizer
:: 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.
Igraph attribute record
igraphHaskellAttributeHasAttr :: IGraph -> AttributeElemtype -> String -> IO Bool Source #