Functions — github.com/douchuan/algorithm

hub / github.com/douchuan/algorithm / functions

Functions655 in github.com/douchuan/algorithm

⨍ Functions 655◇ Types & classes 86

↓ 1 callersMethoddelete_dth

( &mut self, x: Option<NonNull<Node<T>>>, key: &str, d: usize, )

src/strings/tries.rs:163

↓ 1 callersMethoddelete_max

(&mut self)

src/tree/binary/rb2.rs:149

↓ 1 callersMethoddelete_min

(&mut self)

src/tree/binary/rb2.rs:136

↓ 1 callersMethoddfs

(&mut self, g: &dyn IGraph, v: usize)

src/graph/undirected/cc.rs:70

↓ 1 callersMethoddfs

(&mut self, g: &dyn IGraph, v: usize, u: usize)

src/graph/undirected/cycle.rs:47

↓ 1 callersMethoddfs

(&mut self, g: &dyn IGraph, v: usize)

src/graph/undirected/bipartite.rs:61

↓ 1 callersMethoddfs

(&mut self, g: &dyn IGraph, v: usize)

src/graph/undirected/dfs.rs:47

↓ 1 callersMethoddfs

(&mut self, graph: &dyn IGraph, v: usize)

src/graph/directed/scc.rs:50

↓ 1 callersMethoddfs

(&mut self, g: &dyn IGraph, v: usize)

src/graph/util/paths.rs:96

↓ 1 callersMethoddist_to

(&self, i: usize)

src/graph/shortest/cpm.rs:43

↓ 1 callersFunctiondo_check

(items: &[char])

src/strings/palindrome.rs:6

↓ 1 callersFunctiondo_drop

(head: Option<NonNull<Node<T>>>)

src/ll/linked_list.rs:184

↓ 1 callersFunctiondo_find

设链表的长度为 N。设置两个指针 P1 和 P2，先让 P1 移动 K 个节点，则还有 N - K 个节点可以移动。此时让 P1 和 P2 同时移动，可以知道当 P1 移动到链表结尾时，P2 移动到第 N - K 个节点处，该位置就是倒数第 K 个节点。

src/ll/kth2tail.rs:17

↓ 1 callersFunctiondo_reverse

递归，先找到tail，然后从后向前修正指针

src/ll/reverse.rs:9

↓ 1 callersMethoddot

Returns the inner product of this vector with the specified vector.

src/math/sparse_vector.rs:52

↓ 1 callersFunctionexpand_sharp

"#" symbol as empty child

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

↓ 1 callersMethodfind_negative_cycle

by finding a cycle in predecessor graph

src/graph/shortest/bellman_ford_sp.rs:77

↓ 1 callersMethodflip

(&self)

src/tree/binary/node.rs:298

↓ 1 callersMethodget

Returns the value associated with the given key.

src/strings/tries.rs:80

↓ 1 callersMethodhas_parallel_edges

does this graph have two parallel edges?

src/graph/undirected/cycle.rs:73

↓ 1 callersMethodhas_path_to

Returns true if there is a path from the source vertex s to vertex v

src/graph/shortest/dijkstra_sp.rs:69

↓ 1 callersFunctionheight

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

src/tree/binary/tree.rs:49

↓ 1 callersMethodheight

(&self)

src/tree/binary/tree.rs:10

↓ 1 callersMethodi_am_right

(&self)

src/tree/binary/node.rs:235

↓ 1 callersMethodid

(&self, v: usize)

src/graph/directed/scc.rs:40

↓ 1 callersFunctioninsert

Ok(inserted node) Err(()): element exists # Safety This is highly unsafe, due to pointer

src/tree/binary/bst.rs:69

↓ 1 callersMethodinsert

(&mut self, key: K, val: V)

src/tree/binary/rb.rs:136

↓ 1 callersFunctioninsert_fix

( root: Option<NonNull<Node<K, V>>>, x: Option<NonNull<Node<K, V>>>, )

src/tree/binary/rb.rs:155

↓ 1 callersMethodis_branch

(&self)

src/tree/binary/node.rs:244

↓ 1 callersMethodis_leaf

(&self)

src/tree/binary/node.rs:239

↓ 1 callersFunctionis_less

is v less than w, starting at d-th character

src/sort/insert.rs:40

↓ 1 callersFunctionkeys

add the keys between lo and hi in the subtree rooted at x to the queue

src/tree/binary/bst.rs:286

↓ 1 callersMethodkeys_with_prefix

Returns all of the keys in the set that start with *prefix

src/strings/tries.rs:111

↓ 1 callersFunctionlongest_prefix_of_dth

returns the length of the longest string key in the subtrie rooted at x that is a prefix of the query string, assuming the first d character match and

src/strings/tries.rs:259

↓ 1 callersFunctionmake_change_classic

暴力穷举

src/dp/coin.rs:26

↓ 1 callersFunctionmake_change_iter

(coins: &[i32], amount: i32)

src/dp/coin.rs:52

↓ 1 callersMethodmark

(&mut self, graph: &dyn IGraph, s: usize)

src/graph/undirected/dfs2.rs:30

↓ 1 callersMethodmarked

is v reachable?

src/graph/directed/search.rs:31

↓ 1 callersMethodmax

(&self)

src/tree/binary/rb2.rs:183

↓ 1 callersMethodmin

(&self)

src/tree/binary/bst.rs:46

↓ 1 callersMethodmin

(&self)

src/tree/binary/rb2.rs:179

↓ 1 callersMethodnegative_cycle

Returns a negative cycle reachable from the source vertex s, or None if there is no such cycle.

src/graph/shortest/bellman_ford_sp.rs:100

↓ 1 callersMethodopportunity_cycle

(&self)

src/graph/shortest/arbitrage.rs:34

↓ 1 callersFunctionparse_list_num

用空格分割的两个数字 "1 2"

src/graph/util/parser.rs:95

↓ 1 callersFunctionparse_list_rates

USD 1 0.741 0.657 1.061 1.005

src/graph/util/parser.rs:115

↓ 1 callersMethodpartial_cmp

(&self, other: &Self)

src/graph/shortest/directed_edge.rs:32

↓ 1 callersMethodpath_to

Returns a shortest path from the source vertex s to vertex v

src/graph/shortest/dijkstra_sp.rs:74

↓ 1 callersMethodpeek

Returns (but does not remove) the item most recently added to this stack.

src/common/stack.rs:22

↓ 1 callersFunctionpop

(tree: &mut Tree<K, V>)

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

↓ 1 callersMethodpost

Returns the vertices in postorder

src/graph/directed/order.rs:27

↓ 1 callersMethodpre

Returns the vertices in preorder.

src/graph/directed/order.rs:22

↓ 1 callersFunctionpred

# Safety This is highly unsafe, due to pointer

src/tree/binary/bst.rs:175

↓ 1 callersMethodprim

run Prim's algorithm in graph G, starting from vertex s

src/graph/mst/prim_mst.rs:56

↓ 1 callersMethodprim

(&mut self, g: &dyn IEWGraph, s: usize)

src/graph/mst/lazy_prim_mst.rs:45

↓ 1 callersFunctionput

insert the element in the subtree rooted at h

src/tree/binary/rb2.rs:201

↓ 1 callersFunctionput_dth

( x: Option<NonNull<Node<T>>>, key: &str, val: Option<T>, d: usize, )

src/strings/tst.rs:140

↓ 1 callersMethodput_dth

( &mut self, x: Option<NonNull<Node<T>>>, key: &str, val: Option<T>, d

src/strings/tries.rs:140

↓ 1 callersMethodrelax

relax edge e and update pq if changed

src/graph/shortest/dijkstra_sp.rs:49

↓ 1 callersMethodrelax

relax vertex v and put other endpoints on queue if changed

src/graph/shortest/bellman_ford_sp.rs:51

↓ 1 callersFunctionreplace_max_by_min

返回叶子节点的序号

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

↓ 1 callersMethodrev_post

Returns the vertices in reverse postorder.

src/graph/directed/order.rs:32

↓ 1 callersMethodscale

Returns the scalar-vector product of this vector with the specified scalar.

src/math/sparse_vector.rs:81

↓ 1 callersMethodscan

(&mut self, g: &dyn IEWGraph, v: usize)

src/graph/mst/prim_mst.rs:64

↓ 1 callersMethodsearch

Returns the index of the first occurrence of the pattern string in the text string.

src/strings/kmp.rs:35

↓ 1 callersFunctionsearch1

(pat: &str, txt: &str)

src/strings/brute_force.rs:5

↓ 1 callersMethodset_left

(&mut self, x: Option<NonNull<Node<T>>>)

src/strings/tst.rs:277

↓ 1 callersMethodset_mid

(&mut self, x: Option<NonNull<Node<T>>>)

src/strings/tst.rs:281

↓ 1 callersMethodset_right

(&mut self, x: Option<NonNull<Node<T>>>)

src/strings/tst.rs:285

↓ 1 callersFunctionsetup_new_max

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

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

↓ 1 callersMethodstep

(self)

src/graph/util/parser.rs:128

↓ 1 callersFunctionsucc

# Safety This is highly unsafe, due to pointer

src/tree/binary/bst.rs:146

↓ 1 callersMethodto_char

Returns the character corresponding to the argument index

src/strings/alphabet.rs:111

FunctionBellman_Ford_sp

()

tests/test_shortest_paths.rs:167

FunctionDijkstra_all_pairs_sp

()

tests/test_shortest_paths.rs:81

FunctionDijkstra_sp

()

tests/test_shortest_paths.rs:55

MethodE

(&self)

src/graph/directed/digraph.rs:17

MethodE

(&self)

src/graph/shortest/ew_digraph.rs:19

FunctionKruskal_mst

()

tests/test_graph_mst.rs:59

FunctionLSD_radix_sort

()

tests/test_strings.rs:12

FunctionLSD_radix_sort_i32

()

tests/test_strings.rs:30

FunctionMSD_best_case

(b: &mut Bencher)

benches/strings.rs:75

FunctionMSD_radix_sort

()

tests/test_strings.rs:41

FunctionMSD_worst_case

(b: &mut Bencher)

benches/strings.rs:66

FunctionPrim_mst

()

tests/test_graph_mst.rs:45

Functionacyclic_lp

()

tests/test_shortest_paths.rs:112

Functionacyclic_sp

()

tests/test_shortest_paths.rs:89

Functionalphabet

()

tests/test_alphabet.rs:7

Functionarbitrage

()

tests/test_shortest_paths.rs:185

Methodavg_degree

compute average degree

src/graph/undirected/graph.rs:88

Functionbfs_paths

()

tests/test_undirected_graph.rs:91

Functionbfs_paths

()

tests/test_directed_graph.rs:58

Functionbinary_search

()

tests/test_search.rs:4

Functionbinary_search_tree_min_max

()

tests/test_bst_tree.rs:22

Functionbinary_search_tree_succ_pred

()

tests/test_bst_tree.rs:39

Functionbrute_force_search

()

tests/test_strings.rs:344

Functionbst_tree_height

()

tests/test_bst_tree.rs:78

Functionbuild_binary_search_tree

()

tests/test_bst_tree.rs:6

Functionbuild_heap

()

tests/test_common_heap.rs:20

Methodbuild_in_level

(vec: &[&str])

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

Methodbuild_tournament_tree

(data: &[K])

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

← previous next →201–300 of 655, ranked by callers