所有类
-
所有类 接口概要 类概要 类 说明 AcyclicSP 计算加权有向无环图源点最短路径Alphabet 字母表BaseballElimination 预测一支队伍是否数学上与胜利无关BellmanFordSP Bellman-Ford 最短路径算法,可以解决负权重边,并检测负权重环BoggleBoard BoggleSolver 注意,所有字典必须为大写!!!BoyerMoore Boyer-Moore 子字符串匹配算法BreadthFirstPaths 广度优先搜索路径--最短路径BurrowsWheeler Burrows–Wheeler 变换CC 连通分量CircularSuffixArray Burrows–Wheeler 压缩算法的中间数据结构DepthFirstOrder 深度优先搜索排序,支持前序、后序、逆后序DepthFirstPaths DepthFirstSearch 深度优先搜索Digraph DijkstraSP Dijkstra 最短路径算法DirectedCycle 有向图的环检测DirectedDFS DirectedEdge Created by dhx on 2018/7/4.EagerPrimMST Created by dhx on 2018/6/21.Edge Created by dhx on 2018/5/9.EdgeWeightedDigraph Created by dhx on 2018/7/4.EdgeWeightedDirectedCycle TheEdgeWeightedGraph Created by dhx on 2018/5/9.FlowEdge 流量网络的边FlowNetWork 流量网络FordFulkerson Ford-Fulkerson 最大流量算法Graph 图的简单实现,所有参数都没有做验证KMP Knuth-Morris-Pratt 子字符串查找算法,只支持小于256的charKosarajuSCC Kosaraju 强连通算法KruskalMST Created by dhx on 2018/6/20.LazyPrimMST Created by dhx on 2018/6/21.LSD 低位优先的字符串排序MediumG MoveToFront Burrows–Wheeler 压缩算法的中间步骤MSD 高位优先的字符串排序MST Created by dhx on 2018/5/11.NFA 非确定有限状态自动机Paths 路径Quick3String 三向字符串快速排序RabinKarp 基于散列的子字符串查找,不是完全明白,空实现RegexTest SAP shortest ancestral path 两个顶点v,w。SeamCarver SeamCarver 算法,resizing图片Search 搜索起点s与其连通的所有顶点SP Created by dhx on 2018/7/4.Test TinyDAG 有向无环图TinyDG 有向图TinyG 获取tiny graphTopological 有向图的拓扑排序WordNet