úÎ*Ÿ$³P      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMN O NoneP;Non-empty list of adjacent nodes given in ascending order. @ We use new data type to implement custom Eq and Ord instances. Q7Remove minimal edge (from, weight, to) from the queue. <Find shortes path from a beginning node to any ending node. PRSTUVWQXYZ PRSTUVWQXYZNone[\[\None9Assumptiom: root node is last in the serialization list.  ]^_     ]^_None-FIXME: Null node list case. `5Collect unique tries and assign identifiers to them.  !a"#$%&'()*+,-`bcd !"#$%&'()*+,- !"#$%&'*(),-+ !a"#$%&'()*+,-`bcdNone.FCost represents a cost (or weight) of a symbol insertion, deletion or G substitution. It can depend on edit operation position and on symbol  values. 34Cost of edit operation. It has to be non-negative! 4 Position. 5 Word with a character type. 72Simple cost function: all edit operations cost 1. ./01234567 ./01234567 5437./0126./01234567None8"Susbtitution map for an alphabet. 9,Substition desription for some character x. :CCost function with edit operations divided with respect to weight. I Two operations with the same cost should be assigned to the same group. @;TODO: Add Choice data contructor together with appropriate $ implementation: Choice Char Weight JDTransform CostDiv to plain Cost function with default weight value. KCTransform CostDiv to plain Cost function with default weight value  set to +Infinity. 89:;<=>?@ABCDEFGHIJK89:;<=>?@ABCDEFGHIJK@ABC:;<=>?DE9FG8HIJK 89:;<=>?@ABCDEFGHIJKNoneL<Restricted generalized edit distance between two words with  given cost function. LLLLNoneMGFind all words within a list with restricted generalized edit distance  from x lower or equall to k. MMMM NoneNGFind all words within a trie with restricted generalized edit distance  lower or equall to k. NeNNNe NoneOCWe can check, if CostDiv satisfies basic properties. On the other 2 hand, we do not do this for plain Cost function. fghijklmnopqOrsOOfihgjklmnopqOrst    !""#$%&'()*+,-./01 !22+3456789:;<<+34=>?@AB9CDEFGHIJ J JKLKMNOPQRSTUVWXYZ[\] ^ _ ; ` a   b c d e P f g hi adict-0.1.0NLP.Adict.GraphNLP.Adict.DAWG.NodeNLP.Adict.DAWGNLP.Adict.TrieNLP.Adict.CoreNLP.Adict.CostDivNLP.Adict.DistNLP.Adict.BruteNLP.Adict.BasicNLP.Adict.NearestIsEndEdgesminPathNodemkNode nodeValue nodeEdgesRowrowValuerowEdgesDAWGrootarrayDAWGDsizerowvalueInedgesedgeOnentrycharOn serialize deserializeTrieedgeMapTrieDunTriechildanyChildmkTriesetValue substChildinsertfollowlookupfromListtoListfromLangtoDAWGCostdeletesubstWeightPosWord# costDefaultSubMapSubCostDivposModGroupFilterpredicweight mapWeightmkSubunSubsubOnmkSubMaptoCost toCostInfeditDistsearchAdjminViewfromtoEdgeproxyfollspush$fOrdAdj$fEqAdjunNodeunRowmkRow $fBinaryDAWGcollectemptycollect' $fBinaryTrie $fFunctorTriesearch'WhichInsDelnodeIDnodePosnodeCharNodeIDweightOf $fOrdNode$fEqNode