Types & classes — github.com/douchuan/algorithm

CodeHub MCPcopy Create free account

hub / github.com/douchuan/algorithm / types & classes

Types & classes86 in github.com/douchuan/algorithm

⨍ Functions 655◇ Types & classes 86

↓ 35 callersEnumErr

src/math/sparse_vector.rs:136

The AcyclicLP represents a data type for solving the single-source shortest paths problem in edge-weighted directed acyclic graphs (DAGs). The edge we

src/graph/shortest/acyclic_sp.rs:18

The AcyclicSP represents a data type for solving the single-source shortest paths problem in edge-weighted directed acyclic graphs (DAGs). The edge we

src/graph/shortest/acyclic_sp.rs:9

src/strings/alphabet.rs:48

The Arbitrage provides a client that finds an arbitrage opportunity in a currency exchange table by constructing a complete-digraph representation of

src/graph/shortest/arbitrage.rs:24

InterfaceBSTree

src/tree/binary/bst.rs:9

ClassBellmanFordSP

The BellmanFordSP represents a data type for solving the single-source shortest paths problem in edge-weighted digraphs with no negative cycles. The e

src/graph/shortest/bellman_ford_sp.rs:14

ClassBinaryHeap

用数组实现隐式二叉堆 (最大堆)

src/common/max_heap.rs:17

双色问题 Can the vertices of a given graph be assigned one of two colors in such a way that no edge connects vertices of the same color? which is equivale

src/graph/undirected/bipartite.rs:20

ClassBreadthFirstPaths

Run breadth first search on an undirected graph. Runs in O(E + V) time. Run breadth-first search on a digraph. Runs in O(E + V) time.

src/graph/util/paths.rs:32

InterfaceBuildTournamentTree

src/tree/binary/builder/tournament.rs:8

InterfaceBuildTreeInLevel

src/tree/binary/builder/level.rs:15

Connected components

src/graph/undirected/cc.rs:21

Parallel job scheduling Given a set of jobs of specified duration to be completed, with precedence constraints that specify that certain jobs have to

src/graph/shortest/cpm.rs:28

src/tree/binary/node.rs:16

computing the frequency of occurrence of each character over a given alphabet

src/strings/count.rs:5

wrapper for DROPS

src/common/drop.rs:13

src/graph/undirected/cycle.rs:10

ClassDepthFirstOrders

The DepthFirstOrder represents a data type for determining depth-first search ordering of the vertices in a digraph or edge-weighted digraph, includin

src/graph/directed/order.rs:10

ClassDepthFirstPaths

Run depth-first search on an undirected graph. Determine reachability in a digraph from a given vertex using depth-first search. Runs in O(E + V) tim

src/graph/util/paths.rs:21

ClassDepthFirstSearch

src/graph/undirected/dfs.rs:17

src/graph/directed/digraph.rs:6

ClassDijkstraAllPairsSP

The DijkstraAllPairsSP represents a data type for solving the all-pairs shortest paths problem in edge-weighted digraphs where the edge weights are no

src/graph/shortest/dijkstra_sp.rs:17

ClassDijkstraSP

src/graph/shortest/dijkstra_sp.rs:8

ClassDirectedCycle

The DirectedCycle represents a data type for determining whether a digraph has a directed cycle. The has_cycle operation determines whether the digrap

src/graph/directed/cycle.rs:26

ClassDirectedDFS

src/graph/directed/search.rs:3

ClassDirectedEdge

src/graph/shortest/directed_edge.rs:4

src/graph/shortest/ew_digraph.rs:7

The EWGraph class represents an edge-weighted graph of vertices named 0 through V – 1, where each undirected edge is of type Edge and has a real-value

src/graph/mst/ew_graph.rs:19

src/graph/mst/edge.rs:5

ClassEdgeWeightedDirectedCycle

The EdgeWeightedDirectedCycle represents a data type for determining whether an edge-weighted digraph has a directed cycle. The has_cycle operation de

src/graph/directed/cycle.rs:39

src/common/drop.rs:11

src/graph/undirected/graph.rs:43

ClassGraphDataParser

src/graph/util/parser.rs:11

InterfaceIEWDigraph

Edge weighted graph

src/graph/shortest/mod.rs:19

InterfaceIEWGraph

Edge weighted graph

src/graph/mst/mod.rs:53

InterfaceIGraph

src/graph/undirected/mod.rs:31

ClassInOrderVisitor

Binary Tree Inorder Traversal Given a binary tree, return the inorder traversal of its nodes’ values. For example: Given binary tree {1, #, 2, 3}, 1 \

src/tree/binary/traverse.rs:28

src/common/priority_queue.rs:21

src/ll/linked_list.rs:33

src/ll/linked_list.rs:26

src/strings/kmp.rs:26

ClassKosarajuSCC

src/graph/directed/scc.rs:12

ClassKruskalMST

src/graph/mst/kruskal_mst.rs:8

The LSD provides static methods for sorting an array of w-character strings or 32-bit integers using LSD radix sort.

src/strings/lsd.rs:46

ClassLazyPrimMST

src/graph/mst/lazy_prim_mst.rs:8

ClassLevelOrderVisitor

Binary Tree Level Order Traversal Given a binary tree, return the level order traversal of its nodes’ values. (ie, from left to right, level by level)

src/tree/binary/traverse.rs:57

ClassLevelOrderVisitor2

Binary Tree Level Order Traversal 2 Given a binary tree, return the level order traversal of its nodes’ values. (ie, from left to right, level by leve

src/tree/binary/traverse.rs:74

ClassLinkedList

src/ll/linked_list.rs:20

The MSD provides static methods for sorting an array of extended ASCII strings using MSD radix sort.

src/strings/msd.rs:81

src/graph/mst/mod.rs:45

InterfaceMinimal

src/tree/binary/builder/tournament.rs:26

src/strings/tst.rs:11

src/strings/tries.rs:58

src/ll/linked_list.rs:5

src/tree/binary/node.rs:21

src/tree/binary/node.rs:122

ClassNonRecursiveDFS

src/graph/undirected/dfs2.rs:11

src/common/priority_queue.rs:15

Finding paths Given a graph and a source vertex s, support queries of the form: Is there a path from s to a given target vertex v? If so, find such a

src/graph/util/paths.rs:9

ClassPostOrderVisitor

Binary Tree Postorder Traversal Given a binary tree, return the postorder traversal of its nodes’ values. For example: Given binary tree {1, #, 2, 3},

src/tree/binary/traverse.rs:40

ClassPreOrderVisitor

Binary Tree Preorder Traversal Given a binary tree, return the preorder traversal of its nodes’ values. For example: Given binary tree {1, #, 2, 3}, 1

src/tree/binary/traverse.rs:16

The PrimMST represents a data type for computing a minimum spanning tree in an edge-weighted graph. The edge weights can be positive, zero, or negativ

src/graph/mst/prim_mst.rs:15

src/common/queue.rs:14

ClassQuick3String

The Quick3String provides static methods for sorting an array of strings using 3-way radix quicksort.

src/strings/quick3.rs:39

The Quick3Way provides static methods for sorting an array using quicksort with 3-way partitioning.

src/strings/quick3.rs:45

ClassQuickFindUF

The QuickUnionUF represents a union–find data type (also known as the disjoint-sets data type). It supports the classic union and find operations, alo

src/common/uf.rs:41

ClassQuickUnionUF

In particular, suppose that we use quick-find for the dynamic connectivity problem and wind up with a single component. This requires at least N - 1 c

src/common/uf.rs:62

ClassRecoverBinarySearchTree

Two elements of a binary search tree (BST) are swapped by mistake. Recover the tree without changing its structure. Note: A solution using O(n) space

src/tree/binary/traverse.rs:107

InterfaceRedBlackTree

todo: rb tree delete, Chris Okasaki insert-fix

src/tree/binary/rb.rs:128

InterfaceRedBlackTreeV2

src/tree/binary/rb2.rs:102

src/graph/util/parser.rs:121

Given two binary trees, write a function to check if they are equal or not. Two binary trees are considered equal if they are structurally identical a

src/tree/binary/traverse.rs:112

ClassSparseVector

src/math/sparse_vector.rs:15

src/common/stack.rs:6

ClassSymbolGraph

Typical applications involve processing graphs defined in files or on web pages, using strings, not integer indices, to define and refer to vertices.

src/graph/util/symbol_graph.rs:39

src/strings/tst.rs:6

Find the largest M integers. This implementation uses a MinPQ of size at most m + 1 to identify the M largest elements.

src/common/top_m.rs:6

ClassTopological

The Topological represents a data type for determining a topological order of a directed acyclic graph (DAG). A digraph has a topological order if and

src/graph/directed/sort.rs:14

ClassTransitiveClosure

src/graph/directed/transitive_closure.rs:14

src/tree/binary/tree.rs:4

ClassTreeBuilder

src/tree/binary/builder/mod.rs:4

The TrieST represents an symbol table of key-value pairs, with string keys and generic values. It supports the usual put, get, contains, delete, len,

src/strings/tries.rs:53

This implementation uses weighted quick union by rank with path compression by halving.

src/common/uf.rs:79

ClassWeightedQuickUnionUF

Rather than arbitrarily connecting the second tree to the first for union(), we keep track of the size of each tree and always connect the smaller tre

src/common/uf.rs:71

ClassZigzagOrderVisitor

Zigzag Level Order Traversal Given a binary tree, return the level order traversal of its nodes’ values. (ie, from left to right, level by level). For

src/tree/binary/traverse.rs:91