6n[      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~                          ! " # $ % & ' ( ) *+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZNone#[Integral conversion\Floating conversion]Obtain C value from Haskell ^._Obtain Haskell ^ from C value.`#Convert a C enumeration to Haskell.a#Convert a Haskell enumeration to C.bMarshalling of numerals[\]_`abcSafez%   $#"!% $#"!  SafeHIJKHJKISafe.;LMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~;cdefgabhij_`klm]^n[\opqYZrstWXuvwUVxyzT{|}RS~PQNOLMNone!Y-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.delete vertices delete edges+The graph to which the edges will be added.The edges themselves. The attributes of the new edges.yLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~>Safe$Directed graph.Undirected graph.None>?* 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 idEdge id None<>?A#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.6Return all nodes that are associated with given label.Return the label of given edge.Find the edge by edge ID.Find the edge label by edge ID.YDecode a graph from a stream of inputs. This may be more memory efficient than standard decode function.Create a empty graph.Create a graph."Create a graph from labeled edges..Create a graph from a stream of labeled edges.+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.)Apply a function to change nodes' labels.)Apply a function to change edges' labels.'Keep nodes that satisfy the constraint.'Keep edges that satisfy the constraint..Nodes. Each will be assigned a ID from 0 to N.Labeled edges.Input, usually a file,deserialize the input into a stream of edgesdThe number of edges%%NoneFECloseness centralityBetweenness centralityEigenvector centralityGoogle's PageRankPersonalized PageRank.verticesoptional edge weightswhether to normalize edge weights#damping factor, usually around 0.85reset probability NoneF  NoneO Every 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.    NoneZ9The base standard deviation of position change proposals)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.Determines the radius at which vertex-vertex repulsion cancels out attraction of adjacent vertices. A reasonable default value is area times the number of vertices.     None_,Determine whether two graphs are isomorphic. |Creates a graph from the given isomorphism class. This function is implemented only for graphs with three or four vertices.graph to be searched in smaller graph +The number of vertices to add to the graph.The isomorphism class !" !" Nonec(6Generates a random graph with a given degree sequence.)BRandomly rewires a graph while preserving the degree distribution.'directed self-loop( Out degree In degree)%Number of rewiring trials to perform.#$%&'()&#$%'()None6;=d8*+,-./0123456789:;<123456789*+,-./0:;<NoneiQ LeadingEigenvector&number of iterations, default is 10000R  Spinglassnumber of spins, default is 25S  Spinglassthe temperature at the startT  Spinglass'the algorithm stops at this temperatureU  Spinglass.the cooling factor for the simulated annealingV  Spinglass%the gamma parameter of the algorithm.JKLMNOPQRSTUVWMNOPQRSTUVJKLWNonenYbMinimum and maximum size of the cliques to be returned. No bound will be used if negative or zerocliques represented by node idsZbMinimum and maximum size of the cliques to be returned. No bound will be used if negative or zerocliques represented by node idsYZYZe !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^^__``abbccddeeffgghhiijklmnopqrstuvwxyz{|}~                        ! " # $ % & ' ( ) * + ,--./01233456789:;<=>?@ABCDEFGHIJKLMNNOPQRSTUVWXYZ[\]^_`abcdefg+haskell-igraph-0.5.0-9sctYIbBTOh6gsHug2nFPMIGraph.Internal.ConstantsIGraph.Internal.InitializationIGraph.Internal.TypesIGraph.Internal IGraph.TypesIGraph.MutableIGraphIGraph.Structure IGraph.Read IGraph.Motif IGraph.LayoutIGraph.IsomorphismIGraph.GeneratorsIGraph.Exporter.GEXFIGraph.Community IGraph.CliqueIGraph.Internal.C2HSDegseqIgraphDegseqSimpleIgraphDegseqVlIgraphDegseqSimpleNoMultipleRewiringIgraphRewiringSimpleIgraphRewiringSimpleLoops 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 $fEqDegseqHasInithaskelligraphInit'_ igraphInithaskelligraphInit ArpackOptAttributeRecord IGraphEitIGraphEs IGraphVitIGraphVsMatrixBSVectorBSLen StrVector VectorPtrVector withVector allocaVectoraddVectorFinalizer withVectorPtrallocaVectorPtraddVectorPtrFinalizer withStrVectorallocaStrVectoraddStrVectorFinalizer withBSLen withBSVectorallocaBSVectoraddBSVectorFinalizer withMatrix allocaMatrixaddMatrixFinalizer withIGraphVsallocaVsaddVsFinalizer withIGraphVit allocaVitaddVitFinalizer withIGraphEsallocaEsaddEsFinalizer withIGraphEit allocaEitaddEitFinalizer withIGraph allocaIGraphaddIGraphFinalizerwithAttributeRecord withArpackOptigraphArpackNewigraphVectorNewfromListtoListigraphVectorNulligraphVectorFill igraphVectorEigraphVectorSetigraphVectorTailigraphVectorCopyToigraphVectorSizeigraphVectorPtrNewfromPtrstoListsigraphStrvectorNewigraphStrvectorGet toStrVectorbsToByteStringasBS bsvectorNew bsvectorSet toBSVectorigraphMatrixNewigraphMatrixNulligraphMatrixFill igraphMatrixEigraphMatrixSetigraphMatrixCopyToigraphMatrixNrowigraphMatrixNcol fromRowLists toRowLists toColumnLists igraphVsAll igraphVsAdjigraphVsVector igraphVitNew vitToList igraphEsAlligraphEsVector igraphEitNew eitToList igraphCopy igraphNew igraphVcount igraphEcount igraphGetEid igraphEdgeigraphAddVertices igraphAddEdgeigraphAddEdgesigraphDeleteVerticesigraphDeleteEdgeswithAttrigraphHaskellAttributeHasAttrigraphHaskellAttributeGANSetigraphHaskellAttributeGANigraphHaskellAttributeVASigraphHaskellAttributeEANigraphHaskellAttributeEASigraphHaskellAttributeEASSetvigraphHaskellAttributeVASSetigraphHaskellAttributeEASSetDULEdgeEdgeLNodeNode vertexAttredgeAttrMGraphnewaddNodes addLNodesdelNodesaddEdges addLEdgesdelEdgesMLGraph setNodeAttr setEdgeAttr $fMGraphD $fMGraphULGraph_graph _labelToNodeGraph isDirectedisDnNodesnodeslabNodesnEdgesedgeslabEdgeshasEdgenodeLabgetNodesedgeLab getEdgeByEidgetEdgeLabByEiddecodeCemptymkGraphfromLabeledEdgesfromLabeledEdges'freeze unsafeFreezethaw unsafeThaw neighborssucprenmapemapnfilterefilter$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 isoclass4ErdosRenyiModelGNPGNMfullerdosRenyiGamedegreeSequenceGamerewireEdgeAttr _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