Îõ³h$ Ä ˆð      !"#$%&'()*+,-./0123456789:;<=>?@ABCDE F G H I J K L M N O P Q R S T U V WXYZ[\]^_`abcdefghijklmno Safe-Inferred'(>ö      Safe-Inferred'(>H    Safe-Inferred'(>Š Safe-Inferred'(>¼  !"#$% % !"#$ Safe-Inferred'(>ø&'()*+0,-./123465872346587+0,-./1&'()* Safe-Inferred'(>H&*)'(+1/.-0,27856349:9: Safe-Inferred'(>y>hgraphéEdge expansion of a graph, together with a set of verticies certifying that the expansion is not greater.?hgraphëVertex expansion of a graph, together with a set of verticies certifying that the expansion is not greater.>?>? Safe-Inferred'(>§@ABCDA@BCD  Safe-Inferred'(>ÛEFGEFG None'(>HH  Safe-Inferred'(>.II  Safe-Inferred'(>Z JKMNLOPQR PQRJKMNLO  Safe-Inferred'(>–UVUV Safe-Inferred'(>Äp Safe-Inferred'(>pWhgraph!Find a maximum independet set in gXhgraph/Search for an independent set of size at least k in gWXYWXY Safe-Inferred'(>ZhgraphWhether d contains h: as a subgraph (the identity is used for the isomorphism).[hgraphWhether h# is isomorphic to some subgraph of d.\hgraphFind an isomorphism from h to some subgraph of d, if it exists.^hgraphWhether phi is a subgraph isomorphism from h to some subgraph of d.Z[\]^Z[\]^None'(><_`_` Safe-Inferred'(> eghgraphÎFinds an integral linkaged connecting the given terminal pairs, if one exists.hhgraphSpecial case of g where vertices are of type q. | Faster than calling g0 if vertices of the digraph are already of type q.abcdefghfghabcde Safe-Inferred'(> ^lhgraph±All maximal paths on a digraph, represented as a list of vertices. | Cycles are also considered as maximal paths and their corresponding lists contain the initial vertex twice.abcdefghijkl ijklabcde Safe-Inferred'(> ~nhgraphñPath anonymity of a digraph together with a path witnessing | that the anonymity is at least the returned value.ohgraphÐPath anonymity of a maximal path. | The path provided is assumed to be maximal.mnomnoò !"#$%&'()*+,-./01223456789:;<=>? @A"#$BC'DEFGHIJKLMNO P Q R S 9 T T U V W X Y Z [ \ ] ^ _`abcdefgShiijklmnopqrstuvwxyzû%hgraph-1.2.0.1-KvuJd668EQW9sDISQ2HxkuHGraph.DirectedHGraph.Directed.AdjacencyMap!HGraph.Directed.Connectivity.FlowHGraph.Directed.OutputHGraph.UndirectedHGraph.Undirected.AdjacencyMapHGraph.Undirected.ExpandersHGraph.Undirected.Generator$HGraph.Undirected.Layout.SpringModelHGraph.Undirected.LoadHGraph.Undirected.Output#HGraph.Undirected.Solvers.Treedepth%HGraph.Undirected.Solvers.VertexCover(HGraph.Undirected.Solvers.IndependentSetHGraph.Directed.SubgraphHGraph.Directed.Load,HGraph.Directed.Connectivity.IntegralLinkageHGraph.Directed.ConnectivityHGraph.Directed.PathAnonymity HGraph.UtilsMutable addVertex removeVertexaddArc removeArc Adjacency outneighbors inneighbors outdegreeindegree arcExistsmetaBfs DirectedGraphemptyvertices numVerticesarcsnumArcslinearizeVerticesisVertexDigraph emptyDigraph$fMutableDigraph$fAdjacencyDigraph$fDirectedGraphDigraphmaxFlowmaxDisjointPathsminCutminCutIDotStyle graphName everyNode everyEdgenodeAttributesedgeAttributesdefaultDotStyletoDotaddEdge removeEdge neighborsdegree edgeExistsinducedSubgraphconnectedComponentsUndirectedGraphedgesnumEdgesGraph emptyGraph$fMutableGraph$fAdjacencyGraph$fUndirectedGraphGraph edgeExpansionvertexExpansion cycleGraphgrid completeTree completeGraph randomGraphsetupstep positionsloadDot DecompositionancestorchildrendepthrootsoptimalDecompositiontreedepthAtMostisDecomposition$fShowDecomposition$fEqDecompositionminimumVertexCoververtexCoverAtMostmaximizeatLeastreducecontains isSubgraphOfsubgraphIsomorphismsubgraphIsomorphismIisSubgraphIsomorphism loadEdgeListLinkageInstanceliTerminalPairs liLinkageliPath extendLinkagelinkagelinkageI reachableallPaths allLinkagesallMaximalPaths pathAnonymitypathAnonymityCertificatepathPathAnonymityImheadghc-prim GHC.TypesInt