Types & classes — github.com/TheAlgorithms/Rust

CodeHub MCPcopy Create free account

hub / github.com/TheAlgorithms/Rust / types & classes

Types & classes211 in github.com/TheAlgorithms/Rust

⨍ Functions 2,908◇ Types & classes 211

↓ 17 callersClassTestKey

src/data_structures/hash_table.rs:71

↓ 2 callersClassHeapNode

src/compression/huffman_encoding.rs:93

↓ 1 callersClassEdge

src/graph/depth_first_search.rs:46

↓ 1 callersClassEdge

src/graph/breadth_first_search.rs:53

↓ 1 callersClassIntoIter

Collections are iterated in Rust using the Iterator trait, we define a struct implement Iterator

src/data_structures/stack_using_singly_linked_list.rs:124

↓ 1 callersClassNode

src/graph/breadth_first_search.rs:50

↓ 1 callersClassTrie

src/string/autocomplete_using_trie.rs:14

↓ 1 callersClassVertex

src/graph/depth_first_search.rs:44

src/string/aho_corasick.rs:7

An internal node of an `AVLTree`.

src/data_structures/avl_tree.rs:9

A set based on an AVL Tree. An AVL Tree is a self-balancing binary search tree. It tracks the height of each node and performs internal rotations to

src/data_structures/avl_tree.rs:21

# Adam (Adaptive Moment Estimation) optimizer The `Adam (Adaptive Moment Estimation)` optimizer is an adaptive learning rate algorithm used in gradie

src/machine_learning/optimization/adam.rs:52

src/ciphers/aes.rs:222

src/ciphers/aes.rs:229

ClassAhoCorasick

src/string/aho_corasick.rs:14

EnumAnagramError

src/string/anagram.rs:5

ClassAntColonyOptimization

Ant Colony Optimization solver for the Travelling Salesman Problem

src/graph/ant_colony_optimization.rs:37

ClassAutocomplete

src/string/autocomplete_using_trie.rs:70

src/data_structures/b_tree.rs:10

ClassBTreeProps

Why to need a different Struct for props... Check - http://smallcultfollowing.com/babysteps/blog/2018/11/01/after-nll-interprocedural-conflicts/#fnref

src/data_structures/b_tree.rs:17

ClassBasicBloomFilter

src/data_structures/probabilistic/bloom_filter.rs:26

ClassBinarySearchTree

src/sorting/tree_sort.rs:23

ClassBinarySearchTree

This struct implements as Binary Search Tree (BST), which is a simple data structure for storing sorted data

src/data_structures/binary_search_tree.rs:6

ClassBinarySearchTreeIter

src/data_structures/binary_search_tree.rs:180

ClassBipartiteMatching

src/graph/bipartite_matching.rs:5

InterfaceBloomFilter

A Bloom Filter <https://en.wikipedia.org/wiki/Bloom_filter> is a probabilistic data structure testing whether an element belongs to a set or not There

src/data_structures/probabilistic/bloom_filter.rs:6

src/compression/burrows_wheeler_transform.rs:17

src/graph/astar.rs:11

ClassCentroidDecomposition

Centroid Decomposition for a tree. Given a tree, it can be recursively decomposed into centroids. Then the parent of a centroid `c` is the previous c

src/graph/centroid_decomposition.rs:15

InterfaceChromosome

The goal is to showcase how Genetic algorithms generically work See: https://en.wikipedia.org/wiki/Genetic_algorithm for concepts This is the definiti

src/general/genetic.rs:13

src/graph/ant_colony_optimization.rs:22

ClassClassStatistics

Naive Bayes classifier for classification tasks. This implementation uses Gaussian Naive Bayes, which assumes that features follow a normal (Gaussian)

src/machine_learning/naive_bayes.rs:7

ClassCodeBreaker

src/general/genetic.rs:383

src/general/genetic.rs:333

src/data_structures/rb_tree.rs:7

src/conversions/rgb_hsv_conversion.rs:17

src/general/genetic.rs:320

src/sorting/dutch_national_flag_sort.rs:9

EnumCombinationError

src/backtracking/all_combination_of_size_k.rs:6

src/math/fast_fourier_transform.rs:5

InterfaceCountMinSketch

A probabilistic data structure holding an approximate count for diverse items efficiently (using constant space) Let's imagine we want to count items

src/data_structures/probabilistic/count_min_sketch.rs:17

ClassCustomComplexNumber

src/math/quadratic_residue.rs:30

ClassCustomFiniteField

src/math/quadratic_residue.rs:18

This module implements the Disjoint Set Union (DSU), also known as Union-Find, which is an efficient data structure for keeping track of a set of elem

src/graph/disjoint_set_union.rs:7

ClassDecisionTree

src/machine_learning/decision_tree.rs:288

ClassDecrementalConnectivity

A data-structure that, given a forest, allows dynamic-connectivity queries. Meaning deletion of an edge (u,v) and checking whether two vertecies are s

src/graph/decremental_connectivity.rs:12

EnumDepreciationError

src/financial/depreciation.rs:29

InterfaceDetectCycle

src/graph/detect_cycle.rs:5

ClassDiffieHellman

src/ciphers/diffie_hellman.rs:205

ClassDinicMaxFlow

src/graph/dinic_maxflow.rs:34

ClassDirectedGraph

src/data_structures/graph.rs:13

src/dynamic_programming/snail.rs:42

ClassDisjointSetUnion

Disjoint Set Union (Union-Find) data structure, particularly useful for managing dynamic connectivity problems such as determining if two elements are

src/graph/disjoint_set_union.rs:17

src/graph/minimum_spanning_tree.rs:8

ClassEllipticCurve

src/math/elliptic_curve.rs:27

src/conversions/energy.rs:13

ClassEulerianPathSolver

Struct to represent the solver for finding an Eulerian path in a directed graph.

src/graph/eulerian_path.rs:28

ClassFenwickTree

A Fenwick Tree (also known as a Binary Indexed Tree) that supports efficient prefix sum, range sum and point queries, as well as point updates. The F

src/data_structures/fenwick_tree.rs:8

EnumFenwickTreeError

src/data_structures/fenwick_tree.rs:19

A field <https://en.wikipedia.org/wiki/Field_(mathematics)>

src/math/field.rs:8

EnumFindHamiltonianCycleError

src/backtracking/hamiltonian_cycle.rs:6

We assume that T::default() gives "zero" flow and T supports negative values

src/graph/dinic_maxflow.rs:10

ClassFlowResultEdge

src/graph/dinic_maxflow.rs:16

EnumFordFulkersonError

src/graph/ford_fulkerson.rs:10

ClassGenericAlgorithmParams

src/general/genetic.rs:136

ClassGeneticAlgorithm

src/general/genetic.rs:120

Represents a graph using an adjacency matrix.

src/backtracking/hamiltonian_cycle.rs:16

src/graph/depth_first_search.rs:48

src/graph/breadth_first_search.rs:56

Kosaraju algorithm, a linear-time algorithm to find the strongly connected components (SCCs) of a directed graph, in Rust.

src/graph/kosaraju.rs:2

src/graph/tarjans_ssc.rs:1

src/data_structures/graph.rs:64

ClassGraphColoring

A struct representing a graph coloring problem.

src/backtracking/graph_coloring.rs:33

EnumGraphColoringError

src/backtracking/graph_coloring.rs:7

EnumGrayCodeError

src/bit_manipulation/n_bits_gray_code.rs:3

ClassGuessAnswer

src/general/genetic.rs:328

HMAC based on RFC 2104, applicable to many cryptographic hash functions.

src/hashing/hashing_traits.rs:15

EnumHammingDistanceError

src/string/hamming_distance.rs:3

ClassHashCountMinSketch

The common implementation of a CountMinSketch Holding a DEPTH x WIDTH matrix of counts The idea behind the implementation is the following: Let's sta

src/data_structures/probabilistic/count_min_sketch.rs:91

src/data_structures/hash_table.rs:3

InterfaceHashable

src/data_structures/hash_table.rs:14

InterfaceHasher

src/hashing/hashing_traits.rs:1

A heap data structure that can be used as a min-heap, max-heap or with custom comparators. This struct manages a collection of items where the heap p

src/data_structures/heap.rs:17

ClassHeavyLightDecomposition

src/graph/heavy_light_decomposition.rs:21

ClassHillCipher

Hill Cipher implementation

src/ciphers/hill_cipher.rs:36

src/conversions/rgb_hsv_conversion.rs:59

ClassHuffmanDictionary

src/general/huffman_encoding.rs:74

ClassHuffmanEncoding

src/general/huffman_encoding.rs:162

ClassHuffmanNode

src/general/huffman_encoding.rs:16

EnumHuffmanNode

src/compression/huffman_encoding.rs:51

ClassHuffmanValue

src/general/huffman_encoding.rs:7

EnumInfixToPostfixError

src/math/infix_to_postfix.rs:2

InterfaceIntoPressureUnit

Trait for types that can be converted into a PressureUnit

src/conversions/pressure.rs:15

InterfaceIntoWeightUnit

Trait for types that can be converted into a WeightUnit

src/conversions/weight.rs:40

src/conversions/ipv4_conversion.rs:11

EnumIsogramError

src/string/isogram.rs:8

src/dynamic_programming/knapsack.rs:8

src/data_structures/skip_list.rs:258

An iterator over the items of an `Treap`. This struct is created by the `iter` method of `Treap`.

src/data_structures/treap.rs:282

An iterator over the items of an `AVLTree`. This struct is created by the `iter` method of `AVLTree`.

src/data_structures/avl_tree.rs:309

next →1–100 of 211, ranked by callers