w:      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~                !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~SafeNoneIntegral conversionFloating conversionObtain C value from Haskell .Obtain Haskell  from C value.#Convert a C enumeration to Haskell.#Convert a Haskell enumeration to C.Marshalling of numeralsSafes%   !$#"%)('&%%)('&!$#"   None/MNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{/WXYZ[\]^_`acbUVdefgSThijkQROPlmnoMNpqrstuvwxyz{Safe}~}~None$v-Create a igraph object and attach a finalizerLThe 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.+The graph to which the edges will be added.The edges themselves. The attributes of the new edges.!!None%None&None'5name of the attributevalues of the attribute None(+ None( None(00 None* None*       None,  Directed graph. Undirected graph.    None>?1 Create a new graph.Add nodes to the graph.#Add nodes with labels to the graph.Delete nodes from the graph.Add edges to the graph.#Add edges with labels to the graph.Delete edges from the graph.Mutable labeled graph.Set node attribute. Set edge attribute.The number of new nodes.vertices' labelsNode id Edge id  None<>?I##Graph with labeled nodes and edges.(Graph is directed or not.*&Return the number of nodes in a graph.+Return all nodes.  nodes gr == [0 .. nNodes gr - 1].,&Return the number of edges in a graph.-Return all edges..#Whether a edge exists in the graph./Return the label of given node.06Return all nodes that are associated with given label.1Return the label of given edge.2Find the edge by edge ID.3Find the edge label by edge ID.4YDecode a graph from a stream of inputs. This may be more memory efficient than standard decode function.5Create a empty graph.6Create a graph.7"Create a graph from labeled edges.8.Create a graph from a stream of labeled edges.9+Convert a mutable graph to immutable graph.:[Convert a mutable graph to immutable graph. The original graph may not be used afterwards.;Create a mutable graph.<FCreate a mutable graph. The original graph may not be used afterwards.=%Find all neighbors of the given node.>4Find all nodes that have a link from the given node.?.Find all nodes that link to to the given node.@&Keep nodes that satisfy the constraintA)Apply a function to change nodes' labels.B)Apply a function to change edges' labels.C'Keep nodes that satisfy the constraint.D/Map a function over the node labels in a graph.E/Map a function over the edge labels in a graph.6.Nodes. Each will be assigned a ID from 0 to N.Labeled edges.8Input, usually a file,deserialize the input into a stream of edgesThe number of edges%  #$&%'-()*+,./0123456789:;<=>?@ABCDE%'-()*+,./0123#$&%  45678:9<;=?>AB@CDENoneNJCloseness centralityKBetweenness centralityLEigenvector centralityMGoogle's PageRankNPersonalized PageRank.Jverticesoptional edge weightswhether to normalizeM edge weights#damping factor, usually around 0.85Nreset probabilityIJKLMNIJKLMNNoneOEOPQOPQNoneX5REvery triple of vertices in a directed graph 003: A, B, C, the empty graph. 012: A->B, C, a graph with a single directed edge. 102: A -EB, C, a graph with a mutual connection between two vertices. 021D: A -B-gC, the binary out-tree. 021U: A->B<-C, the binary in-tree. 021C: A->B->C, the directed line. 111D: A -B<-C. 111U: A -B->C. 030T: A->B -C,A-C. Feed forward loop. 030C: A -B<-C,A- C. 201: A -B - C. 120D: A -B-C, A -C. 120U: A->B -C,A<-C. 120C: A->B->C, A - C. 210: A->B -C, A - C. 300: A -B -C, A -C, the complete graph.RSRSNonecOY9The base standard deviation of position change proposalsZ)The initial temperature for the annealing[.The cooling factor for the simulated annealing\+The Kamada-Kawai vertex attraction constant^{The maximum length of the move allowed for a vertex in a single iteration. A reasonable default is the number of vertices._This parameter gives the area of the square on which the vertices will be placed. A reasonable default value is the number of vertices squared.`8The cooling exponent. A reasonable default value is 1.5.aDetermines the radius at which vertex-vertex repulsion cancels out attraction of adjacent vertices. A reasonable default value is area times the number of vertices.TUVWXYZ[\]^_`abcdeeTUVWXYZ[\]^_`abcdNonehg,Determine whether two graphs are isomorphic.h|Creates a graph from the given isomorphism class. This function is implemented only for graphs with three or four vertices.fgraph to be searched in smaller graphh+The number of vertices to add to the graph.The isomorphism classfghijfghijNonelLo6Generates a random graph with a given degree sequence.pBRandomly rewires a graph while preserving the degree distribution.ndirected self-loopo Out degree In degreep%Number of rewiring trials to perform.klmnopklmnopNone6;=lqrstuvwxyz{|}~xyz{|}~qrstuvwNoner> LeadingEigenvector&number of iterations, default is 10000  Spinglassnumber of spins, default is 25  Spinglassthe temperature at the start  Spinglass'the algorithm stops at this temperature  Spinglass.the cooling factor for the simulated annealing  Spinglass%the gamma parameter of the algorithm.Nonew&bMinimum and maximum size of the cliques to be returned. No bound will be used if negative or zerocliques represented by node idsbMinimum and maximum size of the cliques to be returned. No bound will be used if negative or zerocliques represented by node ids !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefgghhiijjkkllmnopqrstuvwxyz{|}~                                  !"#$%&&'()*+,-.//0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{||}~+haskell-igraph-0.4.0-CfTwDLXd5oEKyAvzmHPN6KIGraph.Internal.ArpackIGraph.Internal.ConstantsIGraph.Internal.DataIGraph.Internal.InitializationIGraph.Internal.GraphIGraph.Internal.CommunityIGraph.Internal.CliqueIGraph.Internal.AttributeIGraph.Internal.IsomorphismIGraph.Internal.LayoutIGraph.Internal.SelectorIGraph.Internal.MotifIGraph.Internal.Structure IGraph.TypesIGraph.MutableIGraphIGraph.Structure IGraph.Read IGraph.Motif IGraph.LayoutIGraph.IsomorphismIGraph.GeneratorsIGraph.Exporter.GEXFIGraph.Community IGraph.CliqueIGraph.Internal.C2HS ArpackOptigraphArpackNew'_ withArpackOptigraphArpackNewDegseqIgraphDegseqSimpleIgraphDegseqVlIgraphDegseqSimpleNoMultipleRewiringIgraphRewiringSimpleIgraphRewiringSimpleLoops ErdosRenyiIgraphErdosRenyiGnpIgraphErdosRenyiGnm PagerankAlgoIgraphPagerankAlgoPowerIgraphPagerankAlgoArpackIgraphPagerankAlgoPrpackSubgraphImplementationIgraphSubgraphAutoIgraphSubgraphCopyAndDeleteIgraphSubgraphCreateFromScratchAttributeElemtypeIgraphAttributeGraphIgraphAttributeVertexIgraphAttributeEdgeSpinglassImplementationIgraphSpincommImpOrigIgraphSpincommImpNegSpincommUpdateIgraphSpincommUpdateSimpleIgraphSpincommUpdateConfig EdgeOrderTypeIgraphEdgeorderIdIgraphEdgeorderFromIgraphEdgeorderToNeimode IgraphOutIgraphIn IgraphAll IgraphTotal $fEnumNeimode$fEnumEdgeOrderType$fEnumSpincommUpdate$fEnumSpinglassImplementation$fEnumAttributeElemtype$fEnumSubgraphImplementation$fEnumPagerankAlgo$fEnumErdosRenyi$fEnumRewiring $fEnumDegseq $fShowNeimode $fEqNeimode$fShowEdgeOrderType$fEqEdgeOrderType$fShowSpincommUpdate$fEqSpincommUpdate$fShowSpinglassImplementation$fEqSpinglassImplementation$fShowAttributeElemtype$fEqAttributeElemtype$fShowSubgraphImplementation$fReadSubgraphImplementation$fEqSubgraphImplementation$fShowPagerankAlgo$fReadPagerankAlgo$fEqPagerankAlgo$fShowErdosRenyi$fReadErdosRenyi$fEqErdosRenyi$fShowRewiring$fReadRewiring $fEqRewiring $fShowDegseq $fReadDegseq $fEqDegseqMatrixBSVectorBSLen StrVector VectorPtrVector withVectorigraphVectorNewfromListtoListigraphVectorNulligraphVectorFill igraphVectorEigraphVectorSetigraphVectorTailigraphVectorCopyToigraphVectorSize withVectorPtrigraphVectorPtrNewfromPtrstoLists withStrVectorigraphStrvectorNewigraphStrvectorGet toStrVector withBSVector bsvectorNew bsvectorSet toBSVector withMatrixigraphMatrixNewigraphMatrixNulligraphMatrixFill igraphMatrixEigraphMatrixSetigraphMatrixCopyToigraphMatrixNrowigraphMatrixNcol fromRowLists toRowLists toColumnLists$fStorableBSLenHasInithaskelligraphInit'_ igraphInithaskelligraphInitigraphIsoclassCreate'_igraphRewire'_igraphDegreeSequenceGame'_igraphErdosRenyiGame'_ igraphFull'_igraphAddEdges'_igraphAddEdge'_igraphAddVertices'_ igraphEdge'_igraphGetEid'_igraphEcount'_igraphVcount'_ igraphCopy'_ igraphNew''_igraph_destroy withIGraph igraphNew' igraphCopy igraphNew igraphVcount igraphEcount igraphGetEid igraphEdgeigraphAddVertices igraphAddEdgeigraphAddEdges igraphFulligraphErdosRenyiGameigraphDegreeSequenceGame igraphRewireigraphIsoclassCreateT#igraphCommunityLeadingEigenvector'_igraphCommunitySpinglass'_igraphCommunitySpinglass!igraphCommunityLeadingEigenvectorigraphMaximalCliques'_igraphCliques'_ igraphCliquesigraphMaximalCliquesAttributeRecordigraphHaskellAttributeEASSet'_igraphHaskellAttributeVASSet'_igraphHaskellAttributeEASSetv'_igraphHaskellAttributeEAS'_igraphHaskellAttributeEAN'_igraphHaskellAttributeVAS'_igraphHaskellAttributeGAN'_igraphHaskellAttributeGANSet'_igraphHaskellAttributeHasAttr'_asBS asBSVectorfromBSmkStrRecigraphHaskellAttributeHasAttrigraphHaskellAttributeGANSetigraphHaskellAttributeGANigraphHaskellAttributeVASigraphHaskellAttributeEANigraphHaskellAttributeEASigraphHaskellAttributeEASSetvigraphHaskellAttributeVASSetigraphHaskellAttributeEASSet$fStorableAttributeRecordigraphIsomorphic'_igraphGetSubisomorphismsVf2'_igraphGetSubisomorphismsVf2igraphIsomorphicigraphLayoutLgl'_igraphLayoutKamadaKawai'_igraphLayoutKamadaKawaiigraphLayoutLgl IGraphEitIGraphEs IGraphVitIGraphVsigraphDeleteEdges'_igraphDeleteVertices'_igraphEitGet'_igraphEitNext'_igraphEitEnd'_igraphEitNew'_igraph_eit_destroyigraphEsVector'_ igraphEsAll'_igraph_es_destroyigraphVitGet'_igraphVitNext'_igraphVitEnd'_igraphVitNew'_igraph_vit_destroyigraphVsVector'_ igraphVsAdj'_ igraphVsAll'_igraph_vs_destroy withIGraphVs igraphVsAll igraphVsAdjigraphVsVector withIGraphVit igraphVitNew igraphVitEnd igraphVitNext igraphVitGet vitToList withIGraphEs igraphEsAlligraphEsVector withIGraphEit igraphEitNew igraphEitEnd igraphEitNext igraphEitGet eitToListigraphDeleteVerticesigraphDeleteEdgesigraphMotifsRandesu'_igraphTriadCensus'_igraphTriadCensusigraphMotifsRandesuigraphPersonalizedPagerank'_igraphPagerank'_igraphEigenvectorCentrality'_igraphBetweenness'_igraphCloseness'_igraphInducedSubgraph'_igraphInducedSubgraphigraphClosenessigraphBetweennessigraphEigenvectorCentralityigraphPagerankigraphPersonalizedPagerankDULEdgeEdgeNodeMGraphnewaddNodes addLNodesdelNodesaddEdges addLEdgesdelEdgesMLGraph vertexAttredgeAttrwithVertexAttr withEdgeAttr setNodeAttr setEdgeAttr $fMGraphD $fMGraphULGraph_graph _labelToNodeGraph isDirectedisDnNodesnodesnEdgesedgeshasEdgenodeLabgetNodesedgeLab getEdgeByEid edgeLabByEiddecodeCemptymkGraphfromLabeledEdgesfromLabeledEdges'freeze unsafeFreezethaw unsafeThaw neighborssucpre filterNodesmapNodesmapEdges filterEdgesnmapemap$fSerializeLGraph$fGraphD$fGraphUinducedSubgraph closeness betweennesseigenvectorCentralitypagerankpersonalizedPagerank readAdjMatrix fromAdjMatrixreadAdjMatrixWeightedtriad triadCensus LayoutMethod KamadaKawaiLGLkk_seedkk_nIterkk_sigma kk_startTemp kk_coolFactkk_const lgl_nIter lgl_maxdeltalgl_area lgl_coolexplgl_repulserad lgl_cellsizedefaultKamadaKawai defaultLGL getLayoutgetSubisomorphisms isomorphicisoclassCreate isoclass3 isoclass4ErdosRenyiModelGNPGNMerdosRenyiGamedegreeSequenceGamerewireEdgeAttr _edgeLabel _edgeColour _edgeWeight_edgeArrowLength _edgeZindexNodeAttr_size _nodeColour _nodeLabel _positionX _positionY _nodeZindexdefaultNodeAttributesdefaultEdgeAttributes genXMLTree writeGEXF$fSerializeAlphaColour$fHashableNodeAttr$fSerializeNodeAttr$fHashableEdgeAttr$fSerializeEdgeAttr$fShowNodeAttr$fReadNodeAttr $fEqNodeAttr$fGenericNodeAttr$fShowEdgeAttr$fReadEdgeAttr $fEqEdgeAttr$fGenericEdgeAttrCommunityMethodLeadingEigenvector Spinglass CommunityOpt_method_weights_nIter_nSpins _startTemp _stopTemp _coolFact_gamma findCommunity$fDefaultCommunityOptcliquesmaximalCliquescIntConv cFloatConv cFromBoolghc-prim GHC.TypesBoolcToBoolcToEnum cFromEnum peekIntConv peekFloatConvdeserializeGraph