Functions — github.com/djeada/Algorithms-And-Data-Structures

CodeHub MCPcopy Create free account

hub / github.com/djeada/Algorithms-And-Data-Structures / functions

Functions1,481 in github.com/djeada/Algorithms-And-Data-Structures

⨍ Functions 1,481◇ Types & classes 357

↓ 156 callersMethodsize

src/graphs/cpp/bfs/src/graph.cpp:123

↓ 79 callersMethodpush

src/collections_and_containers/cpp/heap/src/heap.cpp:18

↓ 76 callersMethodpush_back

src/collections_and_containers/cpp/vector/src/vector.cpp:79

↓ 72 callersMethodpop

src/collections_and_containers/cpp/heap/src/heap.cpp:31

↓ 61 callersMethodend

src/collections_and_containers/cpp/vector/src/vector.cpp:42

↓ 57 callersMethodempty

src/graphs/cpp/bfs/src/graph.cpp:127

↓ 53 callersMethodadd

src/collections_and_containers/cpp/hash_table/src/hash_table.cpp:24

↓ 47 callersMethodbegin

src/collections_and_containers/cpp/vector/src/vector.cpp:38

↓ 43 callersMethodinsert

src/collections_and_containers/cpp/avl_tree/src/avl_tree.cpp:26

↓ 41 callersMethodget

src/collections_and_containers/cpp/hash_table/src/hash_table.cpp:47

↓ 36 callersMethodinsert

src/collections_and_containers/cpp/red_black_tree/src/red_black_tree.cpp:27

↓ 34 callersMethodinsert

Insert a value into the tree.

src/collections_and_containers/python/binary_search_tree/src/binary_search_tree.py:24

↓ 30 callersMethodinsert

src/collections_and_containers/cpp/binary_search_tree/src/binary_search_tree.cpp:30

↓ 26 callersMethodinsert

Insert a value into the tree.

src/collections_and_containers/python/avl_tree/src/avl_tree.py:25

↓ 26 callersMethodinsert

Insert a value into the tree.

src/collections_and_containers/python/red_black_tree/src/red_black_tree.py:39

↓ 25 callersMethodadd

Add or update a key-value pair.

src/collections_and_containers/python/hash_table/src/hash_table.py:18

↓ 24 callersMethodaddEdge

src/graphs/cpp/prim/src/graph.cpp:55

↓ 24 callersMethodaddEdge

src/graphs/cpp/kruskal/src/graph.cpp:57

↓ 24 callersMethodpush

Add an element to the heap.

src/collections_and_containers/python/heap/src/heap.py:22

↓ 24 callersMethodpush_back

Add an element to the end of the list.

src/collections_and_containers/python/linked_list/src/linked_list.py:23

↓ 23 callersMethodadd_edge

Add an edge to the graph.

src/graphs/python/bellman_ford/src/graph.py:66

↓ 23 callersMethodadd_edge

Add an edge to the graph.

src/graphs/python/dijkstra/src/graph.py:66

↓ 23 callersMethodadd_edge

Add an edge to the graph.

src/graphs/python/bfs/src/graph.py:66

↓ 23 callersMethodadd_edge

Add an edge to the graph.

src/graphs/python/dfs/src/graph.py:66

↓ 21 callersMethodfront

src/collections_and_containers/cpp/queue/src/queue.cpp:65

↓ 21 callersMethodpush_back

src/collections_and_containers/cpp/linked_list/src/linked_list.cpp:32

↓ 19 callersMethodaddEdge

src/graphs/cpp/bellman_ford/src/graph.cpp:54

↓ 19 callersMethodaddEdge

src/graphs/cpp/dijkstra/src/graph.cpp:54

↓ 19 callersMethodaddEdge

src/graphs/cpp/bfs/src/graph.cpp:54

↓ 19 callersMethodaddEdge

src/graphs/cpp/dfs/src/graph.cpp:54

↓ 19 callersMethodadd_edge

Add an edge to the graph.

src/graphs/python/prim/src/graph.py:66

↓ 19 callersMethodadd_edge

Add an edge to the graph.

src/graphs/python/kruskal/src/graph.py:66

↓ 19 callersMethodget

src/brain_teasers/cpp/lru_cache/src/lru_cache.cpp:11

↓ 18 callersMethodpop

Remove and return the top element.

src/collections_and_containers/python/heap/src/heap.py:27

↓ 18 callersMethodpush_back

Add an element to the end of the vector.

src/collections_and_containers/python/vector/src/vector.py:51

↓ 16 callersMethodadd_edge

Add an edge to the graph.

src/graphs/python/graph/src/graph.py:66

↓ 16 callersMethodadd_edge

Add a directed edge from u to v. Args: u: Source vertex. v: Destination vertex.

src/backtracking/python/topological_sort/src/topological_sort.py:18

↓ 16 callersMethodadd_edge

src/backtracking/cpp/topological_sort/src/topological_sort.cpp:8

↓ 16 callersMethodback

src/collections_and_containers/cpp/queue/src/queue.cpp:72

↓ 16 callersMethodput

src/brain_teasers/cpp/lru_cache/src/lru_cache.cpp:22

↓ 15 callersFunctionbellmanFord

src/graphs/cpp/bellman_ford/src/bellman_ford.cpp:7

↓ 15 callersFunctionbfs

src/graphs/cpp/bfs/src/bfs.cpp:8

↓ 15 callersFunctiondfs

src/graphs/cpp/dfs/src/dfs.cpp:8

↓ 15 callersFunctiondijkstra

src/graphs/cpp/dijkstra/src/dijkstra.cpp:9

↓ 15 callersMethodenqueue

src/collections_and_containers/cpp/queue/src/queue.cpp:56

↓ 15 callersFunctionisPalindromeAfterDeletion

src/brain_teasers/cpp/is_palindrome_after_char_deletion/src/palindrome.cpp:15

↓ 15 callersMethodpush

src/collections_and_containers/cpp/stack/src/stack.cpp:46

↓ 14 callersFunctionaddStrings

src/brain_teasers/cpp/add_string_numbers/src/add_string_numbers.cpp:26

↓ 14 callersMethodconnected

Check if two vertices are directly connected by an edge.

src/graphs/python/graph/src/graph.py:98

↓ 14 callersFunctionexponential_search

Search for a target value in a sorted array using exponential search. This algorithm grows the right boundary exponentially (1, 2, 4, 8, ...

src/searching/python/exponential_search/src/exponential_search.py:8

↓ 14 callersFunctioninterpolation_search

Search for a target value in a sorted array using interpolation search. This algorithm estimates the likely position of the target using the

src/searching/python/interpolation_search/src/interpolation_search.py:6

↓ 14 callersFunctionminDeletionsToMakeValid

src/brain_teasers/cpp/deletions_to_make_valid_parentheses/src/valid_parentheses.cpp:3

↓ 14 callersMethodsize

src/collections_and_containers/cpp/hash_table/src/hash_table.cpp:94

↓ 13 callersFunctionbinary_search

Search for a target value in a sorted array using binary search. This algorithm repeatedly halves the search interval by comparing the t

src/searching/python/binary_search/src/binary_search.py:8

↓ 13 callersFunctionfind

(vertex: Vertex)

src/graphs/python/kruskal/src/kruskal.py:24

↓ 13 callersFunctionjump_search

Search for a target value in a sorted array using jump search. This algorithm jumps ahead by fixed block sizes to find the block that may

src/searching/python/jump_search/src/jump_search.py:9

↓ 13 callersMethodpop

src/collections_and_containers/cpp/stack/src/stack.cpp:39

↓ 12 callersMethodaddEdge

src/graphs/cpp/graph/src/graph.cpp:54

↓ 12 callersFunctionbellman_ford

Find the shortest path between source and destination using Bellman-Ford algorithm. This algorithm handles negative edge weights and dete

src/graphs/python/bellman_ford/src/bellman_ford.py:10

↓ 12 callersFunctionbfs

Find the shortest path between source and destination using BFS. Note: BFS finds the shortest path in terms of number of edges, but this

src/graphs/python/bfs/src/bfs.py:11

↓ 12 callersFunctioncanConstructBasic

src/dynamic_programming/cpp/can_construct/src/can_construct.cpp:5

↓ 12 callersMethodcontains

Check if the tree contains a value.

src/collections_and_containers/python/binary_search_tree/src/binary_search_tree.py:77

↓ 12 callersMethodcopy

src/collections_and_containers/cpp/stack/src/stack.cpp:16

↓ 12 callersMethoddequeue

src/collections_and_containers/cpp/queue/src/queue.cpp:45

↓ 12 callersFunctiondfs

Find a path between source and destination using DFS. Note: DFS does not guarantee the shortest path. For shortest paths, use BFS (u

src/graphs/python/dfs/src/dfs.py:10

↓ 12 callersFunctiondijkstra

Find the shortest path between source and destination using Dijkstra's algorithm. This implementation uses a priority queue (min-heap) fo

src/graphs/python/dijkstra/src/dijkstra.py:11

↓ 11 callersMethodadd_edge

Add an undirected edge between vertices u and v. Args: u: First vertex. v: Second vertex.

src/backtracking/python/k_colorable_configurations/src/k_colorable_configurations.py:12

↓ 11 callersMethodadd_edge

Add an undirected edge between vertices u and v. Args: u: First vertex. v: Second vertex.

src/backtracking/python/hamiltonian_paths/src/hamiltonian_paths.py:12

↓ 11 callersMethodadd_edge

src/backtracking/cpp/k_colorable_configurations/src/k_colorable_configurations.cpp:6

↓ 11 callersMethodadd_edge

src/backtracking/cpp/hamiltonian_paths/src/hamiltonian_paths.cpp:6

↓ 11 callersMethodheight

src/collections_and_containers/cpp/red_black_tree/src/red_black_tree.cpp:72

↓ 11 callersFunctioninterpolation_search

src/searching/cpp/interpolation_search/src/interpolation_search.cpp:8

↓ 11 callersMethodpush

Add an element to the top of the stack.

src/collections_and_containers/python/stack/src/stack.py:32

↓ 11 callersMethodsize

src/collections_and_containers/cpp/red_black_tree/src/red_black_tree.cpp:74

↓ 11 callersMethodtop

src/collections_and_containers/cpp/stack/src/stack.cpp:53

↓ 11 callersMethodvisit

src/brain_teasers/cpp/design_browser_history/src/browser_history.cpp:9

↓ 10 callersFunctionbinary_search

src/searching/cpp/binary_search/src/binary_search.cpp:8

↓ 10 callersMethodempty

src/collections_and_containers/cpp/heap/src/heap.cpp:80

↓ 10 callersFunctionexponential_search

src/searching/cpp/exponential_search/src/exponential_search.cpp:9

↓ 10 callersFunctionheap_sort

Sort an array using the heap sort algorithm. This implementation builds a min-heap and repeatedly extracts the minimum element to produc

src/sorting/python/heap_sort/src/heap_sort.py:8

↓ 10 callersFunctionheap_sort

src/sorting/cpp/heap_sort/src/heap_sort.cpp:39

↓ 10 callersFunctioninsertion_sort

Sort an array using the insertion sort algorithm. This algorithm builds the sorted array one element at a time by repeatedly picking the

src/sorting/python/insertion_sort/src/insertion_sort.py:8

↓ 10 callersFunctioninsertion_sort

src/sorting/cpp/insertion_sort/src/insertion_sort.cpp:8

↓ 10 callersFunctionjump_search

src/searching/cpp/jump_search/src/jump_search.cpp:10

↓ 10 callersFunctionlinear_search

Search for a target value in an array using linear search. This algorithm scans the array from left to right, comparing each element wit

src/searching/python/linear_search/src/linear_search.py:8

↓ 10 callersFunctionlinear_search

src/searching/cpp/linear_search/src/linear_search.cpp:8

↓ 10 callersFunctionmerge_sort

Sort an array using the merge sort algorithm with index-based merging. This implementation uses indices instead of slicing in the merge step

src/sorting/python/merge_sort/src/merge_sort.py:8

↓ 10 callersFunctionmerge_sort

src/sorting/cpp/merge_sort/src/merge_sort.cpp:67

↓ 10 callersFunctionmin_insertions_helper

(s: str, l: int, h: int)

src/dynamic_programming/python/minimum_insertions_for_palindrome/src/minimum_insertions_for_palindrome.py:20

↓ 10 callersMethodpeek

Return the top element without removing it.

src/collections_and_containers/python/heap/src/heap.py:36

↓ 10 callersFunctionquick_sort

Sort an array using quick sort with 2-way partitioning. This implementation uses a random pivot selection to avoid worst-case performanc

src/sorting/python/quick_sort/src/quick_sort.py:9

↓ 10 callersFunctionquick_sort

src/sorting/cpp/quick_sort/src/quick_sort.cpp:53

↓ 10 callersFunctionquick_sort_three_way

Sort an array using quick sort with 3-way partitioning. This variant handles duplicate elements more efficiently by partitioning the arr

src/sorting/python/quick_sort/src/quick_sort.py:58

↓ 10 callersFunctionselection_sort

Sort an array using the selection sort algorithm. This algorithm divides the input into a sorted and unsorted region, repeatedly selecti

src/sorting/python/selection_sort/src/selection_sort.py:8

↓ 10 callersFunctionselection_sort

src/sorting/cpp/selection_sort/src/selection_sort.cpp:8

↓ 10 callersMethodsize

src/graphs/cpp/graph/src/graph.cpp:123

↓ 10 callersMethodvisit

Visit a new URL, clearing forward history. Args: url: The URL to navigate to.

src/brain_teasers/python/design_browser_history/src/design_browser_history.py:19

↓ 9 callersMethodback

src/brain_teasers/cpp/design_browser_history/src/browser_history.cpp:16

↓ 9 callersMethodcontains

src/graphs/cpp/graph/src/graph.cpp:105

↓ 9 callersMethodenqueue

Add an element to the back of the queue.

src/collections_and_containers/python/simple_queue/src/simple_queue.py:18

next →1–100 of 1,481, ranked by callers