Code
Hub
Workspaces
Following
Trending
Connect
MCP
copy
Create free account
hub
/
github.com/TheGeekiestOne/Coursera-Data-Structures-and-Algorithms-Specialization
/ functions
Functions
655 in github.com/TheGeekiestOne/Coursera-Data-Structures-and-Algorithms-Specialization
⨍
Functions
655
◇
Types & classes
110
Method
nextInt
()
Course 4 - Algorithms on Strings/assignment 3/kmp/KnuthMorrisPratt.java:21
Method
nextInt
()
Course 4 - Algorithms on Strings/assignment 3/suffix_array_long/SuffixArrayLong.java:20
Method
operator+
implement infinity arithmetic
Course 3 - Algorithms on Graphs/week4_paths2/3_shortest_paths/shortest_paths.cpp:30
Method
operator>
Course 3 - Algorithms on Graphs/week5_mst/1_connecting_points/connecting_points.cpp:34
Method
operator>
infinity comparison
Course 3 - Algorithms on Graphs/week4_paths2/3_shortest_paths/shortest_paths.cpp:48
Method
operator>
Course 3 - Algorithms on Graphs/week4_paths2/1_dijkstra/dijkstra.cpp:25
Function
optimal_summands
(n)
Course 1 - Algorithmic Toolbox/week3_greedy_algorithms/7_maximum_salary/largest_number.py:5
Method
parent
Course 2 - Data Structures/week2_priority_queues_and_disjoint_sets/1_make_heap/build_heap.cpp:50
Function
partition2
Course 1 - Algorithmic Toolbox/week4_divide_and_conquer/3_improving_quicksort/sorting.cpp:31
Method
pop
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_small/dist_preprocess_small.cpp:60
Method
pop
Course 3 - Algorithms on Graphs/Advanced Shortest Path/travelling_salesman_problem/travelling_salesman_problem.cpp:60
Method
potential
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_with_coords/dist_with_coords-aStar.cpp:46
Function
print_stack
Course 2 - Data Structures/week1_basic_data_structures/1_brackets_in_code/check_brackets.cpp:31
Method
print_tree_edges
Course 4 - Algorithms on Strings/assignment 1/non_shared_substring/non_shared_substring.cpp:75
Method
process
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_small-and-large.cpp:94
Method
process
Course 3 - Algorithms on Graphs/Advanced Shortest Path/friend_suggestion/friend_suggestions.cpp:86
Method
processQuery
Course 2 - Data Structures/week3_hash_tables/2_hash_chains/hash_chains.cpp:53
Method
readQuery
Course 2 - Data Structures/week3_hash_tables/2_hash_chains/hash_chains.cpp:39
Method
read_stdin
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_large/dist_preprocess_large.cpp:197
Method
read_stdin
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_small/dist_preprocess_small.cpp:197
Method
read_stdin
Course 3 - Algorithms on Graphs/Advanced Shortest Path/travelling_salesman_problem/travelling_salesman_problem.cpp:197
Function
recursive_preorder_print
Course 4 - Algorithms on Strings/assignment 3/suffix_tree_from_array/suffix_tree_from_array.cpp:218
Method
relax
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_small-and-large.cpp:84
Method
relax
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_with_coords/dist_with_coords-aStar.cpp:65
Method
relax
Course 3 - Algorithms on Graphs/Advanced Shortest Path/friend_suggestion/friend_suggestions.cpp:79
Method
remove_edges
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_small-and-large.cpp:354
Function
rep
Course 2 - Data Structures/week1_basic_data_structures/3_network_simulation/process_packages.cpp:33
Method
reset_containers
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_small-and-large.cpp:74
Method
rightValue
Course 2 - Data Structures/week2_priority_queues_and_disjoint_sets/1_make_heap/build_heap.cpp:46
Method
search_leafs
Course 4 - Algorithms on Strings/assignment 1/non_shared_substring/non_shared_substring.cpp:87
Method
set_n
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_large/dist_preprocess_large.cpp:164
Method
set_n
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_small/dist_preprocess_small.cpp:164
Method
set_n
Course 3 - Algorithms on Graphs/Advanced Shortest Path/travelling_salesman_problem/travelling_salesman_problem.cpp:164
Method
shortcut
(int v)
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_large/DistPreprocessLarge.java:88
Method
shortcut
(int v)
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_small/DistPreprocessSmall.java:88
Method
shortcut
(int v)
Course 3 - Algorithms on Graphs/Advanced Shortest Path/travelling_salesman_problem/TravellingSalesmanProblem.java:88
Method
stacks
Course 2 - Data Structures/week1_basic_data_structures/4_stack_with_max/stack_with_max_naive.cpp:12
Function
stress_test
Course 2 - Data Structures/week4_binary_search_trees/5_rope/rope.cpp:341
Method
sum_contracted_neighbors_and_node_level
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_small-and-large.cpp:226
Method
swimDown
Course 2 - Data Structures/week2_priority_queues_and_disjoint_sets/1_make_heap/build_heap.cpp:54
Method
test_find
Course 2 - Data Structures/week4_binary_search_trees/5_rope/rope.cpp:330
Function
test_solution
Course 2 - Data Structures/week3_hash_tables/3_hash_substring/hash_substring.cpp:92
Function
test_solution
Course 1 - Algorithmic Toolbox/week2_algorithmic_warmup/1_fibonacci_number/fibonacci.cpp:56
Method
traverse
Course 2 - Data Structures/week4_binary_search_trees/5_rope/rope.cpp:216
Method
update
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_large/dist_preprocess_large.cpp:52
Method
update
Try to relax the node v using distance d either in the forward or in the backward search
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_large/dist_preprocess_large.cpp:109
Method
update
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_small/dist_preprocess_small.cpp:52
Method
update
Try to relax the node v using distance d either in the forward or in the backward search
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_small/dist_preprocess_small.cpp:109
Method
update
Course 3 - Algorithms on Graphs/Advanced Shortest Path/travelling_salesman_problem/travelling_salesman_problem.cpp:52
Method
update
Try to relax the node v using distance d either in the forward or in the backward search
Course 3 - Algorithms on Graphs/Advanced Shortest Path/travelling_salesman_problem/travelling_salesman_problem.cpp:109
Method
update_neighbors_node_level
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_small-and-large.cpp:208
Method
visit
See the description of this method in the starter for friend_suggestion
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_with_coords/dist_with_coords.cpp:45
Method
visit
Processes visit of either forward or backward search (determined by value of side), to node v trying to relax the current distance by dist.
Course 3 - Algorithms on Graphs/Advanced Shortest Path/friend_suggestion/friend_suggestion.cpp:62
Method
witness_search
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_small-and-large.cpp:257
Method
writeSearchResult
Course 2 - Data Structures/week3_hash_tables/2_hash_chains/hash_chains.cpp:49
← previous
601–655 of 655, ranked by callers