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

( self, value: int, left: Optional[TreeNode] = None, right: Optional[TreeNode]

src/brain_teasers/python/range_sum_of_bst/src/range_sum_of_bst.py:11

( self, key: int, value: int, next: Optional[ListNode] = None )

src/brain_teasers/python/lru_cache/src/lru_cache.py:11

src/brain_teasers/python/lru_cache/src/lru_cache.py:23

Initialize the LRU cache with a given capacity. Args: capacity: Maximum number of items the cache can hold.

src/brain_teasers/python/lru_cache/src/lru_cache.py:80

Initialize the browser with a homepage. Args: homepage: The initial URL to display.

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

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

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

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

src/brain_teasers/python/lru_cache/src/lru_cache.py:59

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

(self, other: object)

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

(self, other: object)

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

(self, other: object)

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

(self, other: object)

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

(self, other: object)

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

(self, other: object)

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

(self, other: object)

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

(self, other: object)

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

(self, other: object)

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

(self, other: object)

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

(self, other: object)

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

(self, other: object)

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

(self, other: object)

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

(self, other: object)

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

(self, other: object)

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

(self, other: object)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Method__setitem__

(self, i: int, value: Any)

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

Method__setitem__

(self, key: Any, value: Any)

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

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

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

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

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

src/brain_teasers/python/lru_cache/src/lru_cache.py:65

Method_find_min

(p: Optional[Node])

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

MethodaddVertex

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

MethodaddVertex

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

MethodaddVertex

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

MethodaddVertex

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

MethodaddVertex

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

MethodaddVertex

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

MethodaddVertex

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

Methodadd_vertex

Add a vertex to the graph.

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

Methodadd_vertex

Add a vertex to the graph.

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

Methodadd_vertex

Add a vertex to the graph.

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

Methodadd_vertex

Add a vertex to the graph.

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

Methodadd_vertex

Add a vertex to the graph.

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

Methodadd_vertex

Add a vertex to the graph.

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

Methodadd_vertex

Add a vertex to the graph.

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

Functionall_permutations_backtracking

Return all permutations of input_list using in-place backtracking. Time complexity: O(n! * n) where n = len(input_list). We

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

Functionall_permutations_itertools

Return all permutations of input_list using itertools.permutations, converted into lists. Time complexity: O(n! * n) where n = l

src/backtracking/python/all_permutations/src/all_permutations.py:5

src/collections_and_containers/cpp/avl_tree/src/avl_tree.cpp:191

src/collections_and_containers/cpp/red_black_tree/src/red_black_tree.cpp:211

FunctioncanConstructMemo

src/dynamic_programming/cpp/can_construct/src/can_construct.cpp:24

FunctioncanConstructTable

src/dynamic_programming/cpp/can_construct/src/can_construct.cpp:61

src/collections_and_containers/cpp/vector/src/vector.cpp:112

src/collections_and_containers/cpp/heap/src/heap.cpp:82

src/collections_and_containers/cpp/stack/src/stack.cpp:64

src/collections_and_containers/cpp/queue/src/queue.cpp:84

Methodconnected

Check if two vertices are directly connected by an edge.

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

Methodconnected

Check if two vertices are directly connected by an edge.

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

Methodconnected

Check if two vertices are directly connected by an edge.

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

Methodconnected

Check if two vertices are directly connected by an edge.

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

Methodconnected

Check if two vertices are directly connected by an edge.

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

Methodconnected

Check if two vertices are directly connected by an edge.

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

Methodconnected

Check if two vertices are directly connected by an edge.

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

Methodconnected

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

Methodconnected

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

Methodconnected

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

Methodconnected

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

Methodconnected

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

Methodconnected

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

Methodconnected

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

Methodconnected

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

src/collections_and_containers/cpp/linked_list/src/linked_list.cpp:157

Check if the graph contains the given vertex.

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

← previous next →701–800 of 1,481, ranked by callers