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

↓ 1 callersMethodback

Return the back element without removing it.

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

↓ 1 callersMethodback

Return the last element.

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

↓ 1 callersMethodclear

Remove all elements from the vector.

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

↓ 1 callersMethodclear

Remove all elements from the tree.

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

↓ 1 callersMethodclear

Remove all elements from the tree.

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

↓ 1 callersMethodclear

Remove all elements from the list.

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

↓ 1 callersMethodclear

Remove all elements from the tree.

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

↓ 1 callersMethodclear

Remove all elements from the hash table.

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

↓ 1 callersMethodclear

src/collections_and_containers/cpp/vector/src/vector.cpp:145

↓ 1 callersMethodclear

src/collections_and_containers/cpp/avl_tree/src/avl_tree.cpp:56

↓ 1 callersMethodclear

src/collections_and_containers/cpp/binary_search_tree/src/binary_search_tree.cpp:64

↓ 1 callersMethodclear

src/collections_and_containers/cpp/linked_list/src/linked_list.cpp:121

↓ 1 callersMethodclear

src/collections_and_containers/cpp/red_black_tree/src/red_black_tree.cpp:67

↓ 1 callersFunctiondfs

( G: Graph, v: int, colors: List[int], configuration: List[int] )

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

↓ 1 callersFunctiondfs

( G: Graph, v: int, discovered: List[bool], departure: List[int], time

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

↓ 1 callersFunctiondfs

( G: Graph, v: int, visited: List[bool], path: List[int] )

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

↓ 1 callersMethodedges

Return a list of all edges in the graph.

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

↓ 1 callersMethodedges

Return a list of all edges in the graph.

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

↓ 1 callersMethodedges

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

↓ 1 callersMethodedges

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

↓ 1 callersMethodedgesFromVertex

src/graphs/cpp/a_star/src/graph.cpp:110

↓ 1 callersMethodedgesFromVertex

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

↓ 1 callersMethodedgesFromVertex

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

↓ 1 callersMethodedgesFromVertex

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

↓ 1 callersMethodedges_from_vertex

Return all edges originating from the given vertex.

src/graphs/python/a_star/src/graph.py:89

↓ 1 callersMethodedges_from_vertex

Return all edges originating from the given vertex.

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

↓ 1 callersMethodedges_from_vertex

Return all edges originating from the given vertex.

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

↓ 1 callersMethodedges_from_vertex

Return all edges originating from the given vertex.

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

↓ 1 callersMethodedges_from_vertex

Return all edges originating from the given vertex.

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

↓ 1 callersMethodempty

Check if the graph has no vertices.

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

↓ 1 callersMethodempty

src/graphs/cpp/a_star/src/graph.cpp:149

↓ 1 callersMethodempty

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

↓ 1 callersMethodempty

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

↓ 1 callersMethodempty

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

↓ 1 callersMethodexpand

Double the capacity of the queue.

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

↓ 1 callersFunctionfinal_score

Calculate the final score of the game. Args: board: The game board. Returns: 1 if player -1 wins, -1 if player 1 wins,

src/backtracking/python/minimax/src/minimax.py:31

↓ 1 callersFunctionfinal_score

src/backtracking/cpp/minimax/src/minimax.cpp:45

↓ 1 callersMethodfind_min

Find the minimum value in the subtree rooted at p.

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

↓ 1 callersMethodfind_min

Find the minimum value in the subtree rooted at p.

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

↓ 1 callersFunctionfind_tours

Recursively find all knight's tour solutions using backtracking. Args: board: The current state of the board. row: Current r

src/backtracking/python/knight_tour/src/knight_tour.py:25

↓ 1 callersFunctionfind_tours

src/backtracking/cpp/knight_tour/src/knight_tour.cpp:37

↓ 1 callersMethodfront

Return the front element without removing it.

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

↓ 1 callersMethodfront

Return the first element.

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

↓ 1 callersFunctiongame_over

Check if the game has ended. Args: board: The game board. Returns: True if the game is over (someone won or board is fu

src/backtracking/python/minimax/src/minimax.py:53

↓ 1 callersFunctiongame_over

src/backtracking/cpp/minimax/src/minimax.cpp:60

↓ 1 callersFunctiongetShuffledCopy

src/brain_teasers/cpp/randomize_array/src/randomize_array.h:31

↓ 1 callersMethodgrow

Double the capacity of the hash table.

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

↓ 1 callersFunctionheapify

(arr: List[T], curr: int, offset: int)

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

↓ 1 callersFunctionheapify

src/sorting/cpp/heap_sort/src/heap_sort.cpp:19

↓ 1 callersMethodin_order_traversal

Return elements in in-order traversal (left, root, right).

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

↓ 1 callersMethodin_order_traversal

Return elements in in-order traversal (left, root, right).

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

↓ 1 callersMethodinsert_before

Insert a new node with the given value before the given node.

src/brain_teasers/python/bst_to_list/src/bst_to_list.py:38

↓ 1 callersMethodisMaxHeap

src/collections_and_containers/cpp/heap/src/heap.cpp:84

↓ 1 callersMethodisMinHeap

src/collections_and_containers/cpp/heap/src/heap.cpp:86

↓ 1 callersMethodis_max_heap

Check if this is a max-heap.

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

↓ 1 callersMethodis_min_heap

Check if this is a min-heap.

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

↓ 1 callersFunctionkruskal

src/graphs/cpp/kruskal/src/kruskal.cpp:7

↓ 1 callersFunctionmerge

(x: Vertex, y: Vertex)

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

↓ 1 callersFunctionmerge

(array_a: List[T], array_b: List[T])

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

↓ 1 callersFunctionmerge

src/sorting/cpp/merge_sort/src/merge_sort.cpp:17

↓ 1 callersFunctionmerge_sort_impl

src/sorting/cpp/merge_sort/src/merge_sort.cpp:55

↓ 1 callersFunctionminimax

Evaluate the game state using the minimax algorithm. Args: board: The current game board. player: The current player (-1 or

src/backtracking/python/minimax/src/minimax.py:74

↓ 1 callersFunctionminimax

src/backtracking/cpp/minimax/src/minimax.cpp:76

↓ 1 callersFunctionpartition

(arr: List[T], start: int, stop: int)

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

↓ 1 callersMethodpost_order_traversal

Return elements in post-order traversal (left, right, root).

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

↓ 1 callersMethodpost_order_traversal

Return elements in post-order traversal (left, right, root).

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

↓ 1 callersMethodpost_order_traversal

Return elements in post-order traversal (left, right, root).

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

↓ 1 callersMethodpost_order_traversal

src/collections_and_containers/cpp/avl_tree/src/avl_tree.cpp:76

↓ 1 callersMethodpost_order_traversal

src/collections_and_containers/cpp/binary_search_tree/src/binary_search_tree.cpp:92

↓ 1 callersMethodpost_order_traversal

src/collections_and_containers/cpp/red_black_tree/src/red_black_tree.cpp:91

↓ 1 callersMethodpre_order_traversal

Return elements in pre-order traversal (root, left, right).

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

↓ 1 callersMethodpre_order_traversal

Return elements in pre-order traversal (root, left, right).

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

↓ 1 callersMethodpre_order_traversal

Return elements in pre-order traversal (root, left, right).

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

↓ 1 callersMethodpre_order_traversal

src/collections_and_containers/cpp/avl_tree/src/avl_tree.cpp:70

↓ 1 callersMethodpre_order_traversal

src/collections_and_containers/cpp/binary_search_tree/src/binary_search_tree.cpp:85

↓ 1 callersMethodpre_order_traversal

src/collections_and_containers/cpp/red_black_tree/src/red_black_tree.cpp:84

↓ 1 callersFunctionprim

src/graphs/cpp/prim/src/prim.cpp:7

↓ 1 callersMethodpush_front

src/collections_and_containers/cpp/linked_list/src/linked_list.cpp:46

↓ 1 callersFunctionquick_sort_impl

src/sorting/cpp/quick_sort/src/quick_sort.cpp:18

↓ 1 callersMethodremove

Remove a value from the tree.

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

↓ 1 callersMethodremove

Remove a value from the tree.

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

↓ 1 callersMethodremove

src/collections_and_containers/cpp/binary_search_tree/src/binary_search_tree.cpp:34

↓ 1 callersMethodshrink

Halve the capacity of the hash table.

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

↓ 1 callersMethodsize

Return the number of elements in the queue.

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

↓ 1 callersMethodsize

Return the number of elements in the stack.

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

↓ 1 callersMethodsize

src/collections_and_containers/cpp/stack/src/stack.cpp:60

↓ 1 callersMethodsize

src/collections_and_containers/cpp/queue/src/queue.cpp:80

↓ 1 callersMethodsize

Return the number of vertices in the graph.

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

↓ 1 callersMethodtop

Return the top element without removing it.

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

↓ 1 callersFunctiontransform_tour

Transform a list of tour positions into a grid of move numbers. Args: tour: List of (row, col) positions representing the knight's p

src/backtracking/python/knight_tour/src/knight_tour.py:4

↓ 1 callersFunctiontransform_tour

src/backtracking/cpp/knight_tour/src/knight_tour.cpp:17

↓ 1 callersMethodvertices

Return a list of all vertices in the graph.

src/graphs/python/a_star/src/graph.py:81

↓ 1 callersMethodvertices

Return a list of all vertices in the graph.

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

↓ 1 callersMethodvertices

Return a list of all vertices in the graph.

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

↓ 1 callersMethodvertices

Return a list of all vertices in the graph.

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

↓ 1 callersMethodvertices

Return a list of all vertices in the graph.

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

↓ 1 callersMethodvertices

Return a list of all vertices in the graph.

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

↓ 1 callersMethodvertices

Return a list of all vertices in the graph.

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

↓ 1 callersMethodvertices

Return a list of all vertices in the graph.

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

↓ 1 callersMethodvertices

src/graphs/cpp/a_star/src/graph.cpp:100

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