úÎ!ē'˛[`      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXY Z [ \ ]^_ Safe ¸` math-grads=End of each line shouldn't be closer then this to other line.a math-grads#Checks whether two lines intersect.b math-gradsReflects point over given line.c math-grads9Given list of points calculates centroid of these points.d math-grads/Checks two vectors of coordinates for equality.abcd Safe įe math-grads’Given two lists of points produces function that transforms coordinates of given point according to allignment of first list of points on second.f math-gradsOGiven angle in degrees produces rotation matrix that corresponds to that angle.ef Safe&abdefSafeą math-grads9Type class that gives data structure properties of graph. math-grads2Construct a graph from list of vertices and edges. math-grads4Get a list of all vertices and edges from the graph. math-gradsGet the number of vertices. math-gradsUnsafe get adjacent vertices. math-gradsUnsafe get adjacent indices. math-gradsSafe get adjacent vertices. math-gradsSafe get adjacent indices. math-grads-Get a list of edges starting at given vertex.  math-grads2Safe get a list of edges starting at given vertex.  math-grads3Get a list of index edges starting at given vertex.  math-grads8Safe get a list of index edges starting at given vertex.  math-gradsType alias for list of  s.  math-grads n is just triple, containing index of starting vertex of edge, index of ending vertex of edge and edge's type. math-gradsGet edge's type from  . math-grads.Given transformation of edge types transforms  . math-grads2Given transformation of edge's indices transforms  .     9 9 9 9 None%/76č math-grads˙ Generic undirected graph which stores elements of type v in its vertices (e.g. labels, atoms, states etc) and elements of type e in its edges (e.g. weights, bond types, functions over states etc). Note that loops and multiple edges between two vertices are allowed. math-gradsg that contains vrtices of graph math-gradsh$ that maps vertices to their indices math-grads adjacency g of graph math-gradsi. which acts on adjacency lists of each vertex. math-gradsi which acts on vertices. math-gradsGet all vertices of the graph. math-gradskGet subgraph on given vertices. Note that indexation will be CHANGED. Be careful with !. and ?. operators. math-gradsAdd given vertices to graph. math-gradsqRemove given vertices from the graph. Note that indexation will be CHANGED. Be careful with !. and ?. operators. math-gradsmRemove given edges from the graph. Note that isolated vertices are allowed. This will NOT affect indexation. math-gradsAdd given edges to the graph. math-grads<Returns type of edge with given starting and ending indices. math-grads\Safe extraction from the graph. If there is no requested key in it, empty list is returned.  math-grads\Safe extraction from the graph. If there is no requested key in it, empty list is returned.! math-gradsLGet edge from graph, which starting and ending indices match given indices." math-gradsBCheck that two vertices with given indexes have edge between them.# math-gradsRReturns graph that is the sum of two given graphs assuming that they are disjoint. !"#!" #Safe:$* math-grads"nub that works in O(n log n) time.+ math-gradsZips list with its tail., math-grads<Returns all possible subsets of given list as list of lists.*+,*,+None>@AXQ‹- math-grads<Type class for graphs that could be checked for isomorphism.0 math-grads˛Function that checks whether two edges are identical. Due to properties related to index of vertex, like belonging to a cycle, we consider GraphEdge (Int, Int, e) instead of e.1 math-grads˛Function that checks whether two vertices are identical. Due to properties related to index of vertex, like number of neighbors, we consider vertex indices instead of vertices.2 math-gradsType alias for j.3 math-grads)Checks whether two graphs are isomorphic.4 math-gradsCheck for queryGraph  \subseteq  targetGraph.5 math-gradsEGet one vertices matching (if exists) from queryGraph to targetGraph.6 math-gradsCGet all possible vertices matchings from queryGraph to targetGraph.k math-grads`Converts input graph into graph in which vertices with most amount of edges have lowest indices.l math-grads/Ullman's subgraph isomorphism algorithm itself.m math-gradsbReturns True if we can map all neighbors of query vertex to neighbors of target vertex in mMatrix.n math-gradsJChecks whether mMatrix encodes an isomorphism between pMatrix and gMatrix.o math-grads5Componentwise "less or equal" operation for matrices.p math-grads9Replace all elements in row with 0 apart from chosen one.4 math-grads queryGraph math-grads targetGraph5 math-grads queryGraph math-grads targetGraph6 math-grads queryGraph math-grads targetGraphn math-gradsgMatrix math-gradspMatrix math-gradsmMatrix -./0123456 01-./25634Safehē7 math-gradsEquality operator for  s.8 math-gradsInequality operator for  s.9 math-grads3Checks that vertex with given index is incident to  .: math-gradsFind all edges in given  . that are incident to vertex with given index.; math-gradsReturns indices of edges in  . that are incident to vertex with given index.< math-grads*Returns index of vertex incident to given  ! and different from passed index.= math-gradsFinds in given  2 all indices of vertices adjacent to given vertex.> math-gradsEChecks whether two vertices with given indices are adjacent in given  .? math-grads@Retrieves indices of vertices that are being connected by given  .@ math-grads)Checks that two edges have common vertex.A math-grads\Gets shared common vertex of two edges. If edges don't have common vertex, returns Nothing.B math-gradsFind edges in  h which ordered pairs of indices, that they are connecting, are present in passed list of ordered pairs.C math-grads,Find all edges that are incident to edge in   with given index.D math-gradsFor every edge in  0 add to that list an edge in opposite direction.E math-grads Transforms   into hP that corresponds to adjacency list of undirected graph induced by these edges.F math-gradsChecks that two  s have common edge.G math-grads Sorting for  w, that sorts edges on their type, then on index of their to (right) vertex, then on index of their from (left) vertex.H math-gradsGets all vertices from  .789:;<=>?@ABCDEFGH>?<A=:;@978BCDEFGH SafexI math-gradsIZ is pair that containts graph's edge and coordinates of vertices that are incident to it.J math-gradsAlias for list of Is.q math-gradsGenerates vector of random js of given length.r math-gradscGenerates list of random vectors of length numberOfVectors. Each vector has length lengthOfVector.s math-grads Find all Is in J. that are incident to vertex with given index.t math-gradsReflect given cycle in form of J over given axis.u math-gradsReflect given I over given axis.v math-grads)Calculates centroid of vertices in given J.w math-gradsConverts tuple to lis.x math-grads Converts y to pair.z math-gradsConverts pair to y.{ math-gradsGiven J† of conjugated cycles leaves only cycles that don't intersect with each other excluding first cycle in list that is taken by default.| math-gradsLeaves only unique I s in given J.} math-grads Checks that I is present in J.~ math-gradsComparator for Is.IJrstuvwxz{|}~Safe}ėK math-gradsFMap that matches indexes of vertices to coordinates of these vertices. math-grads*(Number of vertex, edge) for linked paths.L math-gradsJThis constant is used to determine length of one edge when graph is drawn.€ math-gradsGiven K and   constructs J. math-grads Converts J int K.‚ math-grads Converts J to 'Map Int (V2 Float)'. IJwKL€‚None†éM math-grads&List of (level, (edgeIdx, vertexIdx)).N math-grads Classic dfs.O math-gradsIGet connected components of graph. Note that indexation will be CHANGED.P math-gradsFGet indices of vertices that belong to different connected components.Q math-gradsDfs a simple cycle.R math-grads$Bfs algorithm that takes graph, its  , M0 corresponding to already visited vertices and M> that corresponds to starting point of traversal and returns M as a result.ƒ math-gradsSTraverses graph from a given starting point (queue) in Breadth-first search manner.MNOPQRMRQNOPNone@AX‹FS math-grads$Type alias for function that, given K- of graph, returns modified version of that K alongside with  = of graph's edges of that shouldn't participate in sampling.„ math-grads8Finds conformation with minimal number of intersections.S„None”>T math-gradsFinds all vertices in   that have only one neighbour.U math-grads>Calculates all branched paths in graph up to the given length.V math-gradsŸCalculates all branched paths up to the given length from given vertex in graph considering indices of vertices that shouldn't be visited during path-finding.W math-grads8Finds path between two vertices in graph represented as  h. Graph shouldn't have any cycles. Hmmm, what's the difference between this function and DFS or BFS?..X math-grads7Finds all paths between vertices with given indices in  .TUVWXUVXWTNone›ī… math-gradsUGiven cycles and paths between them unites everything into one structure if possible.† math-gradsEConstructs edge that will be used to align to cycle containing given Is.‡ math-grads˙If we have complicated situation where we need to calculate bonds to align to for vertex in cycle that has more then 2 neighbors then we pass direction in which we want to place neighbors and use bondsToAlignToExtreme function. Otherwise we use bondsToAlignTo function.…†‡NoneXŸPˆ math-gradsCalculates coordinates of path.‰ math-gradsWTakes path, list of vertices which have been processed and returns links for each path.Š math-grads(Finds all paths between cycles in graph.ˆŠ None§CY math-gradsTakes  Ļ and finds non-redundant set of conjugated simple cycles. Cycles sharing in common one edge are considered to be one cycle. BondList must obey rule (b, e, _) b < e.Z math-grads%Checks that edge with given index in   is contained in any cycle.[ math-gradsLFinds all cycles of minimal length contained in system of conjugated cycles.‹ math-grads8Checks whether or not given vertex belongs to any cycle.\ math-grads:Returns the set of all vertices which belong to any cycle.YZ[\Y[\ZNoneXŠKŒ math-grads\Calculates coordinates of system of cycles and coordinates of edges that are adjacent to it.ŒNone>@A˛] math-grads:Type class that defines whether graph can be drawn or not.^ math-gradsIChange coordinates and fixate edges that shouldn't take part in sampling._ math-gradsGiven  returns K9, which keys correspond to indices of vertices of given ˙&. Works only for simple planar graphs. If graph is neither simple nor planar, returns Nothing. This function is best used for graphs that can be represented as systems of conjugated cycles and paths between them. If graph contains too complex conjugated cycles, function will return Nothing.IJKLS]^_IJK]^SL_Ž !"#$$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ [ \]^_`abcdefghij k l m nopq r s t u v w xyz{|}~y€‚ƒ„…†‡ˆ‰ Š ‹ Œ  Ž   ‘’“” • – — ˜ ™š›œžŸ ĄĸŖ¤Ĩ Ļ§¨ŠĒĢ)math-grads-0.1.5.1-7B87ujPtj5x5Ges5jFRNipMath.Grads.GraphMath.Grads.GenericGraphMath.Grads.UtilsMath.Grads.Algo.IsomorphismMath.Grads.Algo.InteractionMath.Grads.Drawing.CoordsMath.Grads.Algo.TraversalsMath.Grads.Algo.PathsMath.Grads.Algo.Cycles*Math.Grads.Angem.Internal.VectorOperations*Math.Grads.Angem.Internal.MatrixOperationsMath.Grads.Angem!Math.Grads.Drawing.Internal.Utils"Math.Grads.Drawing.Internal.Coords$Math.Grads.Drawing.Internal.Sampling0Math.Grads.Drawing.Internal.CyclesPathsAlignment!Math.Grads.Drawing.Internal.Paths"Math.Grads.Drawing.Internal.CyclesGraphfromListtoListvCount!>!.?>?.incident safeIncident incidentIdxsafeIncidentIdxEdgeList GraphEdgeedgeTypechangeTypeEdgechangeIndsEdge GenericGraphgIndex gRevIndex gAdjacencyapplyGapplyV getVerticessubgraph addVerticesremoveVertices removeEdgesaddEdges typeOfEdgesafeIdxsafeAtgetEdge isConnected sumGraphs$fFunctorGenericGraph$fShowGenericGraph$fGraphGenericGraph$fFromJSONGenericGraph$fToJSONGenericGraph$fGenericGenericGraphnubunitersubsets GComparable vComparator eComparator EComparator VComparator VertexIndexisIsoisIsoSubgetIso getMultiIso~=/~= isIncidentgetVertexIncidentgetVertexIncidentIdx getOtherEndgetVertexAdjacent areAdjacentgetEndshaveSharedVertexgetSharedVertex matchEdgesgetEdgeIncidentdoubleEdgeList edgeListToMaphaveSharedEdge sortBondList getIndicesCoord CoordListCoordMap bondLengthBFSStatedfsgetCompsgetCompsIndicesdfsCyclebfsState EdgeFixatorfindBeginningsallPathsInGraphallPathsFromVertex dfsSearch dfsAllPaths findCycles isEdgeInCyclefindLocalCycles getCyclicDrawable edgeFixatorgetCoordsForGraphepsareIntersected reflectPointavgeqV2 alignmentFunc rotation2DbaseGHC.ArrArraycontainers-0.6.0.1Data.Map.InternalMapGHC.Basefmapghc-prim GHC.TypesIntgraphToGraphIsorecursehasSuitableNeighbors isIsomorphism leqMatrices changeRow randomVector randomVectorsfindIncidentCoords reflectCycle reflectBondcentroid tupleToListuV2$linear-1.20.8-3sreVjoKE3hHcOGmHFBFPX Linear.V2V2pairToV2cleanListOfCoordListscleanCoordList coordElem compareCoordsLinkcoordMapToCoordListcoordListForDrawingcoordListToMap bfsState' bestSamplealignCyclesAndPathsbondsToAlignTobondsToAlignToExtremegetCoordsOfPathfindLinkingPoints findPathsisCyclicgetCoordsOfGlobalCycle!random-1.1-3ypV4EIycgb35PKjTYYr5q System.RandomStdGen