IGraph.Internal

Data structure library: vector, matrix, other data types

Igraph vector type and basic operations

data Vector

allocaVector :: (Ptr Vector -> IO a) -> IO a

Allocate and initialize a vector.

allocaVectorN :: Int -> (Ptr Vector -> IO a) -> IO a

withList :: Real a => [a] -> (Ptr Vector -> IO b) -> IO b

withListMaybe :: Real a => Maybe [a] -> (Ptr Vector -> IO b) -> IO b

Allocate a nullPtr if Nothing

toList :: Ptr Vector -> IO [Double]

igraphVectorNull :: Ptr Vector -> IO ()

igraphVectorFill :: Ptr Vector -> Double -> IO ()

igraphVectorE :: Ptr Vector -> Int -> IO Double

igraphVectorSet :: Ptr Vector -> Int -> Double -> IO ()

igraphVectorTail :: Ptr Vector -> IO Double

igraphVectorSize :: Ptr Vector -> IO Int

igraphVectorCopyTo :: Ptr Vector -> Ptr CDouble -> IO ()

Igraph pointer vector

data VectorPtr

allocaVectorPtr :: (Ptr VectorPtr -> IO a) -> IO a

Allocate and initialize a pointer vector.

allocaVectorPtrN :: Int -> (Ptr VectorPtr -> IO a) -> IO a

withPtrs :: [Ptr a] -> (Ptr VectorPtr -> IO b) -> IO b

toLists :: Ptr VectorPtr -> IO [[Double]]

Customized bytestring for storing attributes

data BSLen

withByteString :: ByteString -> (Ptr BSLen -> IO a) -> IO a

toByteString :: Ptr BSLen -> IO ByteString

Customized bytestring vector

data BSVector

allocaBSVectorN :: Int -> (Ptr BSVector -> IO a) -> IO a

withByteStrings :: [ByteString] -> (Ptr BSVector -> IO a) -> IO a

bsvectorSet :: Ptr BSVector -> Int -> ByteString -> IO ()

Igraph matrix type

data Matrix

allocaMatrix :: (Ptr Matrix -> IO a) -> IO a

allocaMatrixN

Arguments

:: Int

Number of rows

-> Int

Number of columns

-> (Ptr Matrix -> IO a)

-> IO a

withRowLists :: Real a => [[a]] -> (Ptr Matrix -> IO b) -> IO b

toRowLists :: Ptr Matrix -> IO [[Double]]

toColumnLists :: Ptr Matrix -> IO [[Double]]

igraphMatrixNull :: Ptr Matrix -> IO ()

igraphMatrixFill :: Ptr Matrix -> Double -> IO ()

igraphMatrixE :: Ptr Matrix -> Int -> Int -> IO Double

igraphMatrixSet :: Ptr Matrix -> Int -> Int -> Double -> IO ()

igraphMatrixCopyTo :: Ptr Matrix -> Ptr CDouble -> IO ()

igraphMatrixNrow :: Ptr Matrix -> IO Int

igraphMatrixNcol :: Ptr Matrix -> IO Int

Igraph type and constructors

data IGraph

withIGraph :: IGraph -> (Ptr IGraph -> IO b) -> IO b

allocaIGraph :: (Ptr IGraph -> IO a) -> IO a

addIGraphFinalizer :: Ptr IGraph -> IO IGraph

igraphNew :: Int -> Bool -> HasInit -> IO IGraph

Create a igraph object and attach a finalizer

igraphCreate

Arguments

:: Ptr Vector

The edges to add, the first two elements are the first edge, etc.

-> Int

The number of vertices in the graph, if smaller or equal to the highest vertex id in the edges vector it will be increased automatically. So it is safe to give 0 here.

-> Bool

Whether to create a directed graph or not. If yes, then the first edge points from the first vertex id in edges to the second, etc.

-> IO IGraph

Selector and iterator for edge and vertex

Igraph vertex selector

data VertexSelector

withVerticesAll :: (Ptr VertexSelector -> IO a) -> IO a

withVerticesAdj :: Int -> Neimode -> (Ptr VertexSelector -> IO a) -> IO a

withVerticesVector :: Ptr Vector -> (Ptr VertexSelector -> IO a) -> IO a

withVerticesList :: Real a => [a] -> (Ptr VertexSelector -> IO b) -> IO b

Igraph vertex iterator

data VertexIterator

iterateVertices :: IGraph -> Ptr VertexSelector -> (Ptr VertexIterator -> IO a) -> IO a

iterateVerticesC :: IGraph -> Ptr VertexSelector -> (ConduitT i Int IO () -> IO a) -> IO a

Igraph edge Selector

data EdgeSelector

withEdgesAll :: EdgeOrderType -> (Ptr EdgeSelector -> IO a) -> IO a

withEdgeIdsVector :: Ptr Vector -> (Ptr EdgeSelector -> IO a) -> IO a

withEdgeIdsList :: [Int] -> (Ptr EdgeSelector -> IO b) -> IO b

Igraph edge iterator

data EdgeIterator

iterateEdges :: IGraph -> Ptr EdgeSelector -> (Ptr EdgeIterator -> IO a) -> IO a

iterateEdgesC :: IGraph -> Ptr EdgeSelector -> (ConduitT i Int IO () -> IO a) -> IO a

Basic graph operations

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

Arguments

:: IGraph

The graph to which the edges will be added.

-> Ptr 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.

igraphDeleteVertices :: IGraph -> Ptr VertexSelector -> IO ()

delete vertices

igraphDeleteEdges :: IGraph -> Ptr EdgeSelector -> IO ()

delete edges

Igraph attribute record

data AttributeRecord

withAttr

Arguments

:: Serialize a

=> String

Attribute name

-> [a]

Attributes

-> (Ptr AttributeRecord -> IO b)

-> IO b

withBSAttr

Arguments

:: String

Attribute name

-> Ptr BSVector

Attributes

-> (Ptr AttributeRecord -> IO b)

-> IO b

igraphHaskellAttributeHasAttr

Arguments

:: IGraph

-> AttributeElemtype

The type of the attribute

-> String

The name of the attribute

-> IO Bool

Checks whether a (graph, vertex or edge) attribute exists

igraphHaskellAttributeVAS

Arguments

:: IGraph

-> String

The name of the attribute

-> Int

The id of the queried vertex

-> IO (Ptr BSLen)

Query a string vertex attribute

igraphHaskellAttributeEAS

Arguments

:: IGraph

-> String

The name of the attribute

-> Int

The id of the queried edge

-> IO (Ptr BSLen)

Query a string edge attribute.

igraphHaskellAttributeVASSet :: IGraph -> String -> Int -> Ptr BSLen -> IO ()

igraphHaskellAttributeVASSetv

Arguments

:: IGraph

-> String

Name of the attribute

-> Ptr BSVector

String vector, the new attribute values. The length of this vector must match the number of vertices.

-> IO ()

igraphHaskellAttributeEASSet

Arguments

:: IGraph

-> String

The name of the attribute

-> Int

The id of the queried vertex

-> Ptr BSLen

The (new) value of the attribute.

-> IO ()

Set a string edge attribute.

igraphHaskellAttributeEASSetv

Arguments

:: IGraph

-> String

Name of the attribute

-> Ptr BSVector

String vector, the new attribute values. The length of this vector must match the number of edges.

-> IO ()

Set a string edge attribute for all edges.

Igraph arpack options type

data ArpackOpt

allocaArpackOpt :: (Ptr ArpackOpt -> IO a) -> IO a