Functions — github.com/alexfertel/rust-algorithms

hub / github.com/alexfertel/rust-algorithms / functions

Functions990 in github.com/alexfertel/rust-algorithms

⨍ Functions 990◇ Types & classes 106

Functiondelete

()

src/data_structures/rb_tree.rs:639

Functiondelete_at_start

()

src/data_structures/rope.rs:405

Functiondelete_in_middle

()

src/data_structures/rope.rs:389

Functiondepth_first_search

(graph: &Graph, start: Vertex, end: Vertex)

src/graphs/depth_first_search.rs:4

Functiondijkstra

Performs Dijsktra's algorithm on the given `graph` from the given `start`. `graph` is a positively-weighted undirected graph. Returns a map that for

src/graphs/dijkstra.rs:12

Functiondirected_right_edge

()

src/graphs/depth_first_search.rs:58

Functiondirected_right_edge

()

src/graphs/breadth_first_search.rs:59

Functiondirected_wrong_edge

()

src/graphs/depth_first_search.rs:71

Functiondirected_wrong_edge

()

src/graphs/breadth_first_search.rs:72

Functiondistance_five

()

src/string/hamming_distance.rs:43

Functiondistance_four

()

src/string/hamming_distance.rs:38

Functiondistance_three

()

src/string/hamming_distance.rs:33

Functiondistance_zero

()

src/string/hamming_distance.rs:28

Functiondivided

()

src/graphs/depth_first_search.rs:97

Functiondivided

()

src/graphs/breadth_first_search.rs:98

Functiondivisible_by_mpf

()

src/math/linear_sieve.rs:91

Methoddrop

(&mut self)

src/data_structures/stack_using_singly_linked_list.rs:109

Functiondumbbell

()

src/graphs/strongly_connected_components.rs:130

Functioneach_letter_matches

()

src/string/rabin_karp.rs:91

Functioneach_letter_matches

()

src/string/knuth_morris_pratt.rs:63

Functioneasy_bivariate_clustering

()

src/general/kmeans.rs:143

Functioneasy_univariate_clustering

()

src/general/kmeans.rs:110

Functioneasy_univariate_clustering_odd_number_of_data

()

src/general/kmeans.rs:126

Methodedges

(&self)

src/data_structures/graph.rs:110

Functionedit_distance

edit_distance(str_a, str_b) returns the edit distance between the two strings. This edit distance is defined as being 1 point per insertion, substitut

src/dynamic_programming/edit_distance.rs:18

Functionedit_distance_se

The space efficient version of the above algorithm. Instead of storing the `m * n` matrix explicitly, only one row (of length `n`) is stored. It keep

src/dynamic_programming/edit_distance.rs:53

Functionegg_drop

Egg Dropping Puzzle `egg_drop(eggs, floors)` returns the least number of egg droppings required to determine the highest floor from which an egg will

src/dynamic_programming/egg_dropping.rs:8

Functioneggs2_floors10

()

src/dynamic_programming/egg_dropping.rs:78

Functioneggs2_floors2

()

src/dynamic_programming/egg_dropping.rs:68

Functioneggs2_floors36

()

src/dynamic_programming/egg_dropping.rs:83

Functioneggs3_floors5

()

src/dynamic_programming/egg_dropping.rs:73

Functionempty

()

src/graphs/prim.rs:66

Functionempty

()

src/general/convex_hull.rs:72

Functionempty

()

src/sorting/sleep_sort.rs:67

Functionempty

()

src/string/burrows_wheeler_transform.rs:88

Functionempty

()

src/ciphers/sha256.rs:200

Functionempty

()

src/ciphers/vigenere.rs:68

Functionempty

()

src/ciphers/caesar.rs:47

Functionempty

()

src/searching/kth_smallest.rs:65

Functionempty

()

src/searching/fibonacci_search.rs:47

Functionempty

()

src/searching/kth_smallest_heap.rs:59

Functionempty

()

src/searching/jump_search.rs:35

Functionempty

()

src/searching/linear_search.rs:45

Functionempty

()

src/searching/binary_search.rs:36

Functionempty

()

src/searching/exponential_search.rs:35

Functionempty_string

()

src/string/rabin_karp.rs:139

Functionempty_string

()

src/string/knuth_morris_pratt.rs:114

Functionempty_strings

()

src/string/hamming_distance.rs:23

Functionencode_and_decode

()

src/ciphers/polybius.rs:163

Functionencode_emoji

()

src/ciphers/polybius.rs:130

Functionencode_empty

()

src/ciphers/polybius.rs:125

Functionencrypt_letters_and_special_characters

()

src/ciphers/morse_code.rs:251

Functionencrypt_message_with_unsupported_character

()

src/ciphers/morse_code.rs:261

Functionencrypt_only_letters

()

src/ciphers/morse_code.rs:241

Functioneq

(p1: Option<(Point, Point)>, p2: Option<(Point, Point)>)

src/geometry/closest_points.rs:112

Methodeq

(&self, other: &Self)

src/graphs/minimum_spanning_tree.rs:11

Functionequal_graphs

(g1: &mut Graph<V>, g2: &mut Graph<V>)

src/graphs/prufer_code.rs:78

Functionequal_strings

()

src/dynamic_programming/edit_distance.rs:93

Functionerror

()

src/sorting/sleep_sort.rs:79

Functionexpected_loss

()

src/graphs/depth_first_search_tic_tac_toe.rs:390

Functionextended_euclidean_algorithm

(a: i32, b: i32)

src/math/extended_euclidean_algorithm.rs:7

Functionfail_change

()

src/dynamic_programming/coin_change.rs:60

Functionfail_empty_list

()

src/searching/binary_search_recursive.rs:39

Functionfail_search_integers

()

src/searching/binary_search_recursive.rs:129

Functionfail_search_strings_asc

()

src/searching/binary_search_recursive.rs:85

Functionfail_search_strings_desc

()

src/searching/binary_search_recursive.rs:96

Methodfast_power

(mut base: Self, mut power: u64)

src/math/quadratic_residue.rs:55

Functionfibonacci

fibonacci(n) returns the nth fibonacci number This function uses the definition of Fibonacci where: F(0) = F(1) = 1 and F(n+1) = F(n) + F(n-1) for n>0

src/dynamic_programming/fibonacci.rs:9

Functionfills_and_empties

()

src/data_structures/stack.rs:56

Functionfills_and_empties

()

src/data_structures/queue.rs:50

Functionfind

()

src/data_structures/rb_tree.rs:617

Functionfind_root

(f: fn(f64) -> f64, fd: fn(f64) -> f64, guess: f64, iterations: i32)

src/math/newton_raphson.rs:1

Functionfinds_in_kn

()

src/graphs/depth_first_search.rs:28

Functionfinds_in_kn

()

src/graphs/breadth_first_search.rs:29

Functionfinds_max_value

()

src/searching/ternary_search_min_max_recursive.rs:56

Functionfinds_max_value

()

src/searching/ternary_search_min_max.rs:58

Functionfinds_max_value_2

()

src/searching/ternary_search_min_max_recursive.rs:84

Functionfinds_max_value_2

()

src/searching/ternary_search_min_max.rs:86

Functionfinds_min_value

()

src/searching/ternary_search_min_max_recursive.rs:70

Functionfinds_min_value

()

src/searching/ternary_search_min_max.rs:72

Functionfinds_min_value_2

()

src/searching/ternary_search_min_max_recursive.rs:98

Functionfinds_min_value_2

()

src/searching/ternary_search_min_max.rs:100

Methodfmt

(&self, f: &mut Formatter<'_>)

src/data_structures/rope.rs:14

Methodfmt

(&self, f: &mut fmt::Formatter)

src/data_structures/graph.rs:9

Methodfrom

(item: u32)

src/graphs/representation.rs:20

Methodfrom_iter

(iter: I)

src/data_structures/avl_tree.rs:405

Methodfrom_vec

function to build the tree

src/data_structures/segment_tree.rs:16

Functiongaussian_elimination

(matrix: &mut [Vec<f32>])

src/math/gaussian_elimination.rs:6

Functiongcd

returns the greatest common divisor of n numbers

src/math/gcd_of_n_numbers.rs:2

Functionget_longest_palindrome_by_manacher

()

src/string/manacher.rs:83

Methodget_state

(&self)

src/math/random.rs:102

Methodget_u16

(&mut self)

src/math/random.rs:87

Methodget_u8

(&mut self)

src/math/random.rs:92

Functiongraph_1

()

src/graphs/dijkstra.rs:116

Functiongraph_1

()

src/graphs/prim.rs:129

Functiongraph_1

()

src/graphs/bellman_ford.rs:150

Functiongraph_2

()

src/graphs/prim.rs:152

Functiongraph_2

()

src/graphs/bellman_ford.rs:194

Functiongraph_3

()

src/graphs/prim.rs:176

Functiongraph_with_negative_loop

()

src/graphs/bellman_ford.rs:249

← previous next →401–500 of 990, ranked by callers