Îõ³h*ÄmÄ      !"#$%&'()*+, - . / 0 1 2 3 4 5 6 7 8 9 : ; < = > ? @ A B C D E F G H I J K L M N O P Q R S T U V W X Y Z [\]^_`abcdefghijklmnopqrstuvwxyz{|}~€‚ƒ„…†‡ˆ‰Š‹ŒŽ‘’“”•–—˜™š›œžŸ ¡¢£¤¥¦§¨©ª«¬­®¯°±²³´µ¶·¸¹º»¼½¾¿ÀÁÂÃ1.10.0.0# Safe-Inferred)*•ÄÅÆ Safe-Inferred)*Â’hgraph"Runs the producer until it output Çë. Each successful product is sent to the consumer. Returns an IO action which takes the next product (or Ç if there are no more products) Safe-Inferred)*ÂÁ     Safe-Inferred)*   Safe-Inferred)*ÂDhgraphé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)*Âs Safe-Inferred)*¤ Safe-Inferred)*ÂÑ   Safe-Inferred)*Âþ '()!"$#%& '()!"$#%&  Safe-Inferred)*Â;,-,-  Safe-Inferred)*®0hgraphLists all subsets of s of size exactly k../01./01  Safe-Inferred)*Âa2hgraph!Find a maximum independet set in g3hgraph/Search for an independent set of size at least k in g234234  Safe-Inferred)*Â’6578:96578:9  Safe-Inferred)* |VhgraphFind an isomorphism from d0 to d1, if it exists.YhgraphSplit each vertex v" of the digraph into two vertices v_in and v_out. All incoming arcs of v become incoming arcs of v_in, all outgoing arcs from v become outgoing arcs from v_out% and there is an arc `(v_in, v_out)`.ãThis operation is useful when obtaining a vertex variant of arc-based algorithms like maximum flow.ZhgraphThe line digraph of a digraph d" is the digraph `(V', A')`, where V' is the set of arcs of d' there is an arc (a,b) if the head of b in d is the same as the tail of a in d. IJKLOMNP@CDHABEFG;<=>?RQSTZUVWYX IJKLOMNP@CDHABEFG;<=>?RQSTZUVWYX Safe-Inferred)* ¦[hgraphWhether 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._hgraphEnumerate all subgraphs of d which are isomorphic to hahgraphWhether phi is a subgraph isomorphism from h to some subgraph of d.[\]^a_`[\]^a_` Safe-Inferred)*Â ß jbcdefghi jbcdefghi Safe-Inferred)*Âklkl Safe-Inferred)*ÂL monpqrstu monpqrstu Safe-Inferred)*‰pqsrpqsr Safe-Inferred)*Âxxhgraph7A cycle where vertices are connected in both directionsyhgraph8Generate a random weakly-connected acyclic digraph with n vertices and m + n - 1 arcs.xy{zxy{z Safe-Inferred)*Âî|hgraphVertices that s can reach.hgraph±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.‚hgraphÆAll strongly connected components of a digraph, in an arbitrary order.|}~€‚|}~€‚ Safe-Inferred)*Â-ƒ„…†ƒ„…†  Safe-Inferred)*Âhƒ„ƒ„ Safe-Inferred)*ÂœhgraphIs the vertex set A well-linked to the vertex set B'? That is, is there, for every subset A' of A, some subset B' of B5 of the same size such that there is a linkage from A' to B'3 containing as many paths as there are vertices in A'?ŽhgraphSearch for a subset A' of va and a subset B' of vb- of the same size such that no linkage from A' to B', connecting all vertices in both sets exist. Š‰‡ˆ‹ŒŽ‘ Š‰‡ˆ‹ŒŽ‘ Safe-Inferred)*Âó’“”•–—’“”•–—! Safe-Inferred)*Â6’“’“ Safe-Inferred)*Âi˜žœ›š™Ÿ ¡¢£¤¥˜žœ›š™Ÿ ¡¢£¤¥" Safe-Inferred)*ÂÌ  ¡Ÿ˜™š›œž  ¡Ÿ˜™š›œž Safe-Inferred)* ¬hgraphÎFinds an integral linkaged connecting the given terminal pairs, if one exists.­hgraphSpecial case of ¬ where vertices are of type È. | Faster than calling ¬0 if vertices of the digraph are already of type È.«¬­¦§¨©ª«¬­¦§¨©ª# Safe-Inferred)*Âk¦§¨©ªŠ‰‡ˆ‹ŒŽ‘«¬­~|}€‚¦§¨©ª Safe-Inferred)*Â9°hgraph"Whether there is some subgraph of d, which is isomorphic to some subdivision of h°±²³´°±²³´ Safe-Inferred)*ÂW¶hgraphñPath anonymity of a digraph together with a path witnessing | that the anonymity is at least the returned value.·hgraphÐPath anonymity of a maximal path. | The path provided is assumed to be maximal.µ¶·µ¶· Safe-Inferred)*Âøhgraph:A packing of pairwise arc-disjoint cycles of maximum size.¹hgraph?Computes a packing of pairwise disjoint cycles of maximum size.ºhgraph‘Computes a packing of pairwise disjoint cycles of maximum size. Vertices of the input digraph must be labeled with integers from `0` to `n - 1`.¸¹º»¼½¾¸¹º»¼½¾$ Safe-Inferred)* ¸¹º¸¹º Safe-Inferred)*ÂA"¿À;<=>?IJKLOMNP@CDHABEFGXRQSTZUVWY¿ÀÉ%&'()*+,-./0123456789:;<=>?@ABCDEFFGHIJKLMNO P Q R S T U V W X Y Z [ \ ] ^ ' ( ) _ ` , a b c d e f g 1 h 4 5 6 i j 9 k l m n 0 o p q r s tuvwxyz{||}~€‚EDƒ„„…†‡ˆ‰Š‹ŒŽ‘’“”•–—˜™š›œžŸ ¡¢£¤¥¦§™š¨©ªœ««¬­®¯°±²³´µ¶·¸¸¹º»¼½¾¿ÀÁÂÃÄÅÆÇÈÉÊËÌͨÎÏÐÑÒÓÔÕÖ×ÕÖØÙÚÛÜÝÞß&hgraph-1.10.0.0-Gw4w3yG2MdpCrTN3YuAtDNHGraph.ParallelHGraph.UndirectedHGraph.Undirected.AdjacencyMapHGraph.Undirected.Expanders$HGraph.Undirected.Layout.SpringModelHGraph.Undirected.LoadHGraph.Undirected.Output#HGraph.Undirected.Solvers.Treedepth%HGraph.Undirected.Solvers.VertexCover HGraph.Utils(HGraph.Undirected.Solvers.IndependentSetHGraph.Undirected.GeneratorHGraph.DirectedHGraph.Directed.SubgraphHGraph.Directed.OutputHGraph.Directed.Load-HGraph.Directed.Generator.Hereditary.InternalHGraph.Directed.Generator"HGraph.Directed.Connectivity.Basic