Functions — github.com/douchuan/algorithm

CodeHub MCPcopy Create free account

hub / github.com/douchuan/algorithm / functions

Functions655 in github.com/douchuan/algorithm

⨍ Functions 655◇ Types & classes 86

src/common/top_m.rs:12

(v: usize, w: usize, weight: f32)

src/graph/mst/edge.rs:12

(g: &dyn IEWGraph)

src/graph/mst/kruskal_mst.rs:14

Compute a minimum spanning tree (or forest) of an edge-weighted graph

src/graph/mst/prim_mst.rs:24

(g: &dyn IEWGraph)

src/graph/mst/lazy_prim_mst.rs:16

(g: &dyn IGraph)

src/graph/undirected/cc.rs:29

(g: &dyn IGraph)

src/graph/undirected/cycle.rs:17

(g: &dyn IGraph)

src/graph/undirected/bipartite.rs:29

(graph: &dyn IGraph, s: usize)

src/graph/undirected/dfs2.rs:16

(g: &dyn IGraph, s: usize)

src/graph/undirected/dfs.rs:23

Computes the transitive closure of the digraph

src/graph/directed/transitive_closure.rs:20

src/graph/directed/order.rs:38

src/graph/directed/cycle.rs:71

(graph: &dyn IGraph)

src/graph/directed/scc.rs:19

(g: &dyn IEWDigraph, s: usize)

src/graph/shortest/dijkstra_sp.rs:22

Computes a shortest paths tree from s to every other vertex in the edge-weighted digraph G.

src/graph/shortest/bellman_ford_sp.rs:26

(v: usize, w: usize, weight: f32)

src/graph/shortest/directed_edge.rs:11

(g: &dyn IEWDigraph, s: usize)

src/graph/shortest/acyclic_sp.rs:24

build graph specified in i using delim to separate vertex names

src/graph/util/symbol_graph.rs:70

(g: &dyn IGraph, s: usize)

src/graph/util/paths.rs:88

Initializes a d-dimensional zero vector.

src/math/sparse_vector.rs:22

( key: K, val: Option<V>, left: Option<NonNull<Node<K, V>>>, right: Option<Non

src/tree/binary/node.rs:32

Methodnew_entry

(key: K, val: V)

src/tree/binary/node.rs:59

src/tree/binary/node.rs:55

(key: K, val: Option<V>, parent: Option<NonNull<Node<K, V>>>)

src/tree/binary/node.rs:51

Methodnew_max_pq

The MaxPQ represents a priority queue of generic keys. It supports the usual insert and delete-the-max operations, along with methods for peeking at t

src/common/priority_queue.rs:46

Methodnew_min_pq

The MinPQ represents a priority queue of generic keys. It supports the usual insert and delete-the-minimum operations, along with methods for peeking

src/common/priority_queue.rs:36

Methodnew_multi

find vertices in G that are reachable from sources

src/graph/directed/search.rs:18

Methodnew_parent

create NodeQuery from node parent

src/tree/binary/node.rs:132

Methodnew_single

find vertices in G that are reachable from s

src/graph/directed/search.rs:9

Functionnon_recursive_dfs

tests/test_undirected_graph.rs:61

tests/test_linked_list.rs:4

Methodnumber_of_self_loops

count self-loops

src/graph/undirected/graph.rs:93

Methodout_degree

(&self, v: usize)

src/graph/shortest/ew_digraph.rs:44

Functionpalindrome

tests/test_strings.rs:362

tests/test_shortest_paths.rs:18

Functionparse_float

src/graph/util/parser.rs:88

tests/test_undirected_graph.rs:11

tests/test_directed_graph.rs:13

Returns a shortest path from vertex s to vertex t

src/graph/shortest/dijkstra_sp.rs:147

(&self, v: usize)

src/graph/util/paths.rs:44

MinPQ: Returns a smallest key on this priority queue MaxPQ: Returns a largest key on this priority queue

src/common/priority_queue.rs:76

Returns the item least recently added to this queue

src/common/queue.rs:30

Methodpeek_index

MinPQ: Returns an index associated with a minimum key MaxPQ: Returns an index associated with a maximum key

src/common/priority_queue.rs:166

tests/test_sparse_vec.rs:32

tests/test_common_heap.rs:36

src/common/max_heap.rs:30

Functionpostorder_iter

tests/test_tree_traverse.rs:132

Functionpostorder_recursive

tests/test_tree_traverse.rs:124

Functionpreorder_iter

tests/test_tree_traverse.rs:59

Functionpreorder_morris

tests/test_tree_traverse.rs:72

Functionpreorder_recursive

tests/test_tree_traverse.rs:85

Functionpush_front

tests/test_linked_list.rs:17

Inserts the key-value pair into the symbol table, overwriting the old value with the new value if the key is already in the symbol table. If the value

src/strings/tries.rs:88

tests/test_common.rs:11

(b: &mut Bencher)

benches/common.rs:20

Functionquick3str

tests/test_strings.rs:55

Functionquick3way

tests/test_strings.rs:69

Functionquick_find_uf

tests/test_common.rs:159

Returns the number of characters in this alphabet (the radix)

src/strings/alphabet.rs:132

Functionrb_tree_height

tests/test_rb_tree.rs:4

Methodreachable

Is there a directed path from vertex v to vertex w in the digraph?

src/graph/directed/transitive_closure.rs:29

Methodrecursive

# Safety This is highly unsafe, due to pointer 时间复杂度 O(n), 空间复杂度 O(n)

src/tree/binary/traverse.rs:201

(node: NonNull<Node<K, V>>)

src/tree/binary/node.rs:63

Functionrepeat_insert

tests/test_rb_tree2.rs:45

Functionreverse

tests/test_linked_list.rs:34

directed graph op

src/graph/undirected/mod.rs:47

tests/test_sparse_vec.rs:22

tests/test_directed_graph.rs:131

(arr: &[K], k: K)

src/search/binary.rs:5

tests/test_directed_graph.rs:91

Functionsearch2

(pat: &str, txt: &str)

src/strings/brute_force.rs:27

tests/test_common_heap.rs:46

(node: Option<NonNull<Self>>)

src/tree/binary/node.rs:89

Returns the number of vertices in the connected component containing vertex *v*.

src/graph/undirected/cc.rs:64

Methodsize_hint

src/ll/linked_list.rs:147

Functionsmall_merge_v1

(b: &mut Bencher)

benches/sort.rs:11

Functionsmall_merge_v2

(b: &mut Bencher)

benches/sort.rs:55

Functionsmall_merge_v3

(b: &mut Bencher)

benches/sort.rs:99

Functionsmall_quick

(b: &mut Bencher)

benches/sort.rs:143

Functionsmall_selection_sort

(b: &mut Bencher)

benches/sort.rs:196

Functionsmall_selection_tree_selection

(b: &mut Bencher)

benches/sort.rs:204

选择排序从待排序的数据元素中选出最小（或最大）的一个元素，然后放到已排序的序列的末尾，直到全部待排序的数据元素的个数为零。选择排序是不稳定的排序方法

src/sort/selection.rs:8

快速排序 C. A. R. Hoare在1960年提出。它的基本思想是：通过一趟排序将要排序的数据分割成独立的两部分，其中一部分的所有数据都比另外一部分的所有数据都要小，然后再按此方法对这两部分数据分别进行快速排序，整个排序过程可以递归进行，以此达到整个数据变成有序序列

src/sort/quick.rs:9

src/sort/floyd.rs:11

src/sort/insert.rs:7

src/sort/merge.rs:55

冒泡排序（Bubble Sort）它重复地走访过要排序的元素列，依次比较两个相邻的元素，如果顺序（如从大到小、首字母从Z到A）错误就把他们交换过来。走访元素的工作是重复地进行直到没有相邻元素需要交换，也就是说该元素列已经排序完成。这个算法的名字由来是因为越小的元素会经由交换慢慢“浮”到

src/sort/bubble.rs:13

Rearranges the array of strings in ascending order.

src/strings/quick3.rs:54

Rearranges the array of extended ASCII strings in ascending order.

src/strings/msd.rs:90

Functionsort_cocktail

鸡尾酒排序 (Cock-tail sort) 每次扫描可以同时查找最小值和最大值，将最小值放到开头，最大值放到末尾

src/sort/selection.rs:28

(a: &mut [i32])

src/strings/lsd.rs:85

Functionsort_i32_LSD_radix

(b: &mut Bencher)

benches/strings.rs:40

Functionsort_i32_std_Vec

(b: &mut Bencher)

benches/strings.rs:22

Functionsort_str_LSD_radix

(b: &mut Bencher)

benches/strings.rs:30

Functionsort_str_MSD_radix

(b: &mut Bencher)

benches/strings.rs:48

Functionsort_str_quick3strings

(b: &mut Bencher)

benches/strings.rs:57

Functionsort_str_std_Vec

(b: &mut Bencher)

benches/strings.rs:13

Functionsorted_data

tests/test_strings.rs:84

tests/test_math.rs:4

← previous next →501–600 of 655, ranked by callers