MCPcopy Create free account

hub / github.com/TheGeekiestOne/Coursera-Data-Structures-and-Algorithms-Specialization / functions

Functions655 in github.com/TheGeekiestOne/Coursera-Data-Structures-and-Algorithms-Specialization

⨍ Functions 655◇ Types & classes 110
↓ 47 callersMethodpush
Course 2 - Data Structures/week1_basic_data_structures/4_stack_with_max/stack_with_max_naive.cpp:20
↓ 39 callersMethodnextInt
()
Course 3 - Algorithms on Graphs/Advanced Shortest Path/travelling_salesman_problem/TravellingSalesmanProblem.java:167
↓ 29 callersMethodfind
Course 3 - Algorithms on Graphs/week5_mst/2_clustering/clustering.cpp:52
↓ 22 callersMethodadd
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_large/dist_preprocess_large.cpp:120
↓ 22 callersMethodread
(self)
Course 2 - Data Structures/week4_binary_search_trees/1_tree_traversals/tree-orders.py:8
↓ 21 callersMethodempty
Course 3 - Algorithms on Graphs/week2_decomposition2/1_acyclicity/acyclicity.cpp:62
↓ 19 callersMethodinsert
Course 2 - Data Structures/week4_binary_search_trees/5_rope/rope.cpp:205
↓ 17 callersFunctionmin
A utility function to find minimum of two float values
Course 1 - Algorithmic Toolbox/week4_divide_and_conquer/6_closest_points/closest.cpp:88
↓ 15 callersMethodresize
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_large/dist_preprocess_large.cpp:117
↓ 14 callersMethodpop
Course 2 - Data Structures/week1_basic_data_structures/4_stack_with_max/stack_with_max_naive.cpp:34
↓ 14 callersMethodpop
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_large/dist_preprocess_large.cpp:60
↓ 13 callersFunctionupdate
Course 2 - Data Structures/week4_binary_search_trees/5_rope/rope.cpp:32
↓ 12 callersMethodempty
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_large/dist_preprocess_large.cpp:48
↓ 9 callersMethodadd
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_small/dist_preprocess_small.cpp:120
↓ 9 callersMethodadd
Course 3 - Algorithms on Graphs/Advanced Shortest Path/travelling_salesman_problem/travelling_salesman_problem.cpp:120
↓ 9 callersFunctiongetIndex
Course 4 - Algorithms on Strings/assignment 3/suffix_array_long/suffix_array_long.cpp:20
↓ 8 callersMethodempty
Course 2 - Data Structures/week1_basic_data_structures/4_stack_with_max/stack_with_max_naive.cpp:16
↓ 7 callersFunctionsmallRotation
(v)
Course 2 - Data Structures/week4_binary_search_trees/4_set_range_sum/set_range_sum.py:21
↓ 7 callersFunctionsmall_rotation
Course 2 - Data Structures/week4_binary_search_trees/5_rope/rope.cpp:45
↓ 7 callersFunctionsmall_rotation
Course 2 - Data Structures/week4_binary_search_trees/4_set_range_sum/set_range_sum.cpp:40
↓ 6 callersMethodclear
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:35
↓ 6 callersFunctionfind
Searches the tree for the node in position k (1-based) ~ k-th order statistic Assume k in [1, size]
Course 2 - Data Structures/week4_binary_search_trees/5_rope/rope.cpp:105
↓ 5 callersFunctionmerge
Course 2 - Data Structures/week4_binary_search_trees/5_rope/rope.cpp:186
↓ 5 callersFunctionmerge
Course 2 - Data Structures/week4_binary_search_trees/4_set_range_sum/set_range_sum.cpp:143
↓ 5 callersFunctionsplit
Course 2 - Data Structures/week4_binary_search_trees/4_set_range_sum/set_range_sum.cpp:127
↓ 5 callersFunctionupdate
(v)
Course 2 - Data Structures/week4_binary_search_trees/4_set_range_sum/set_range_sum.py:12
↓ 5 callersFunctionupdate
Course 2 - Data Structures/week4_binary_search_trees/4_set_range_sum/set_range_sum.cpp:27
↓ 4 callersFunctiondist
A utility function to find the distance between two points
Course 1 - Algorithmic Toolbox/week4_divide_and_conquer/6_closest_points/closest.cpp:66
↓ 4 callersFunctioneval
Course 1 - Algorithmic Toolbox/week6_dynamic_programming2/3_maximum_value_of_an_arithmetic_expression/placing_parentheses.cpp:16
↓ 4 callersFunctionfibonacci_fast
Course 1 - Algorithmic Toolbox/week2_algorithmic_warmup/1_fibonacci_number/fibonacci.cpp:24
↓ 4 callersMethodresize
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_small/dist_preprocess_small.cpp:117
↓ 4 callersMethodresize
Course 3 - Algorithms on Graphs/Advanced Shortest Path/travelling_salesman_problem/travelling_salesman_problem.cpp:117
↓ 4 callersFunctionsplay
Makes splay of the given vertex and makes it the new root.
Course 2 - Data Structures/week4_binary_search_trees/5_rope/rope.cpp:90
↓ 3 callersFunctiondisplay
Course 2 - Data Structures/week4_binary_search_trees/1_tree_traversals/tree-orders.cpp:15
↓ 3 callersFunctiondisplay
Course 2 - Data Structures/week3_hash_tables/3_hash_substring/hash_substring.cpp:85
↓ 3 callersFunctiondistance
Course 3 - Algorithms on Graphs/week5_mst/2_clustering/clustering.cpp:80
↓ 3 callersFunctionfind
Searches for the given key in the tree with the given root and calls splay for the deepest visited node after that. If found, returns a pointer to the
Course 2 - Data Structures/week4_binary_search_trees/4_set_range_sum/set_range_sum.cpp:105
↓ 3 callersFunctionnew_tree_node
Course 4 - Algorithms on Strings/assignment 3/suffix_tree_from_array/suffix_tree_from_array.cpp:107
↓ 3 callersMethodnext
()
Course 4 - Algorithms on Strings/assignment 3/kmp/KnuthMorrisPratt.java:15
↓ 3 callersMethodnext
()
Course 4 - Algorithms on Strings/assignment 3/suffix_array_matching/SuffixArrayMatching.java:17
↓ 3 callersMethodnextLong
()
Course 3 - Algorithms on Graphs/Advanced Shortest Path/travelling_salesman_problem/TravellingSalesmanProblem.java:170
↓ 3 callersMethodprint
(List<Integer> x)
Course 4 - Algorithms on Strings/assignment 3/kmp/KnuthMorrisPratt.java:39
↓ 3 callersMethodprocess
Course 2 - Data Structures/week4_binary_search_trees/5_rope/rope.cpp:240
↓ 3 callersMethodresult
Course 2 - Data Structures/week4_binary_search_trees/5_rope/rope.cpp:310
↓ 3 callersMethodset_value
Course 3 - Algorithms on Graphs/week4_paths2/3_shortest_paths/shortest_paths.cpp:24
↓ 3 callersFunctionsplay
(v)
Course 2 - Data Structures/week4_binary_search_trees/4_set_range_sum/set_range_sum.py:59
↓ 3 callersFunctionsplay
Makes splay of the given vertex and makes it the new root.
Course 2 - Data Structures/week4_binary_search_trees/4_set_range_sum/set_range_sum.cpp:85
↓ 3 callersFunctionsplit
Course 2 - Data Structures/week4_binary_search_trees/5_rope/rope.cpp:124
↓ 3 callersFunctionsplit
(root, key)
Course 2 - Data Structures/week4_binary_search_trees/4_set_range_sum/set_range_sum.py:94
↓ 2 callersMethodadd_edge
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_small-and-large.cpp:59
↓ 2 callersMethodadd_edge
(int side, int u, int v, Long c)
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_large/DistPreprocessLarge.java:48
↓ 2 callersMethodadd_edge
(int side, int u, int v, Long c)
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_small/DistPreprocessSmall.java:48
↓ 2 callersMethodadd_edge
(int side, int u, int v, Long c)
Course 3 - Algorithms on Graphs/Advanced Shortest Path/travelling_salesman_problem/TravellingSalesmanProblem.java:48
↓ 2 callersFunctioncreate_new_leaf
Course 4 - Algorithms on Strings/assignment 3/suffix_tree_from_array/suffix_tree_from_array.cpp:117
↓ 2 callersFunctiondistance
(p1, p2)
Course 1 - Algorithmic Toolbox/week4_divide_and_conquer/6_closest_points/closest.py:27
↓ 2 callersFunctiongetIndex
Course 4 - Algorithms on Strings/assignment 3/suffix_array_matching/suffix_array_matching.cpp:27
↓ 2 callersFunctionget_max_index
(array)
Course 1 - Algorithmic Toolbox/week3_greedy_algorithms/4_maximum_advertisement_revenue/dot_product.py:15
↓ 2 callersMethodget_parent
(self, table)
Course 2 - Data Structures/week2_priority_queues_and_disjoint_sets/3_merging_tables/merging_tables.py:24
↓ 2 callersFunctionhash
Course 2 - Data Structures/week3_hash_tables/3_hash_substring/hash_substring.cpp:15
↓ 2 callersFunctioninsert
(x)
Course 2 - Data Structures/week4_binary_search_trees/4_set_range_sum/set_range_sum.py:125
↓ 2 callersFunctionmerge
(left, right)
Course 2 - Data Structures/week4_binary_search_trees/4_set_range_sum/set_range_sum.py:108
↓ 2 callersMethodnext
()
Course 4 - Algorithms on Strings/assignment 3/suffix_tree_from_array/SuffixTreeFromArray.java:15
↓ 2 callersMethodnext
()
Course 4 - Algorithms on Strings/assignment 3/suffix_array_long/SuffixArrayLong.java:14
↓ 2 callersMethodnext
()
Course 3 - Algorithms on Graphs/Advanced Shortest Path/travelling_salesman_problem/TravellingSalesmanProblem.java:160
↓ 2 callersMethodnextInt
()
Course 4 - Algorithms on Strings/assignment 3/suffix_tree_from_array/SuffixTreeFromArray.java:21
↓ 2 callersFunctionrabin_karp
Rabin-Karp's algorithm for searching pattern in a text
Course 2 - Data Structures/week3_hash_tables/3_hash_substring/hash_substring.cpp:49
↓ 2 callersMethodvisit
(int side, int v, Long dist)
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_large/DistPreprocessLarge.java:82
↓ 2 callersMethodvisit
(int side, int v, Long dist)
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_with_coords/DistWithCoords.java:51
↓ 2 callersMethodvisit
(int side, int v, Long dist)
Course 3 - Algorithms on Graphs/Advanced Shortest Path/friend_suggestion/FriendSuggestion.java:51
↓ 2 callersMethodvisit
(int side, int v, Long dist)
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_small/DistPreprocessSmall.java:82
↓ 2 callersMethodvisit
(int side, int v, Long dist)
Course 3 - Algorithms on Graphs/Advanced Shortest Path/travelling_salesman_problem/TravellingSalesmanProblem.java:82
↓ 1 callersMethodAstar
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_with_coords/dist_with_coords-aStar.cpp:74
↓ 1 callersFunctionBWT
(text)
Course 4 - Algorithms on Strings/assignment 2/bwt/bwt.py:4
↓ 1 callersFunctionBWT
Course 4 - Algorithms on Strings/assignment 2/bwt/bwt.cpp:19
↓ 1 callersFunctionChangePriority
Course 2 - Data Structures/week2_priority_queues_and_disjoint_sets/2_job_queue/job_queue.cpp:83
↓ 1 callersFunctionCountOccurrences
Compute the number of occurrences of string pattern in the text given only Burrows-Wheeler Transform bwt of the text and additional information
Course 4 - Algorithms on Strings/assignment 2/bwmatching/bwmatching.py:20
↓ 1 callersFunctionInverseBWT
(bwt)
Course 4 - Algorithms on Strings/assignment 2/bwtinverse/bwtinverse.py:4
↓ 1 callersFunctionIsBinarySearchTree
Course 2 - Data Structures/week4_binary_search_trees/2_is_bst/is_bst.cpp:60
↓ 1 callersFunctionIsBinarySearchTree
(tree)
Course 2 - Data Structures/week4_binary_search_trees/2_is_bst/is_bst.py:8
↓ 1 callersFunctionIsBinarySearchTree
(tree)
Course 2 - Data Structures/week4_binary_search_trees/3_is_bst_advanced/is_bst_hard.py:8
↓ 1 callersFunctionIsBinarySearchTree
Course 2 - Data Structures/week4_binary_search_trees/3_is_bst_advanced/is_bst_hard.cpp:56
↓ 1 callersMethodMatchc
Course 2 - Data Structures/week1_basic_data_structures/1_brackets_in_code/check_brackets.cpp:14
↓ 1 callersMethodMax
(self)
Course 2 - Data Structures/week1_basic_data_structures/4_stack_with_max/stack_with_max_naive.py:15
↓ 1 callersFunctionMaxPairwiseProductFast
TO DO: Implement a fast algorithm to speed up run time
Course 1 - Algorithmic Toolbox/week1_programming_challenges/2_maximum_pairwise_product/max_pairwise_product.cpp:43
↓ 1 callersMethodPop
(self)
Course 2 - Data Structures/week1_basic_data_structures/4_stack_with_max/stack_with_max_naive.py:11
↓ 1 callersFunctionPreprocessBWT
Preprocess the Burrows-Wheeler Transform bwt of some text and compute as a result: * starts - for each character C in bwt, starts[C] is the f
Course 4 - Algorithms on Strings/assignment 2/bwmatching/bwmatching.py:5
↓ 1 callersMethodPush
(self, a)
Course 2 - Data Structures/week1_basic_data_structures/4_stack_with_max/stack_with_max_naive.py:8
↓ 1 callersFunctionSiftdown
Course 2 - Data Structures/week2_priority_queues_and_disjoint_sets/2_job_queue/job_queue.cpp:45
↓ 1 callersMethodSolve
Course 2 - Data Structures/week2_priority_queues_and_disjoint_sets/1_make_heap/build_heap.cpp:80
↓ 1 callersMethodSolve
Course 2 - Data Structures/week2_priority_queues_and_disjoint_sets/1_make_heap/build_heap - Copy.cpp:51
↓ 1 callersMethodSuffixTreeFromSuffixArray
( int[] suffixArray, int[] lcpArray, final String text)
Course 4 - Algorithms on Strings/assignment 3/suffix_tree_from_array/SuffixTreeFromArray.java:55
↓ 1 callersMethod_explore
Course 3 - Algorithms on Graphs/week2_decomposition2/1_acyclicity/acyclicity.cpp:19
↓ 1 callersMethod_explore
Course 3 - Algorithms on Graphs/week2_decomposition2/2_toposort/toposort.cpp:21
↓ 1 callersMethod_explore
Course 3 - Algorithms on Graphs/week2_decomposition2/3_strongly_connected/strongly_connected.cpp:22
↓ 1 callersMethod_hash_func
(self, s)
Course 2 - Data Structures/week3_hash_tables/2_hash_chains/hash_chains.py:22
↓ 1 callersMethod_reverse_explore
Course 3 - Algorithms on Graphs/week2_decomposition2/3_strongly_connected/strongly_connected.cpp:33
↓ 1 callersFunctionacyclic
(adj)
Course 3 - Algorithms on Graphs/week2_decomposition2/1_acyclicity/acyclicity.py:6
↓ 1 callersMethodadd_coords
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_with_coords/dist_with_coords-aStar.cpp:57
↓ 1 callersMethodadd_edge
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_with_coords/dist_with_coords-aStar.cpp:61
↓ 1 callersMethodadd_edge
Course 3 - Algorithms on Graphs/Advanced Shortest Path/friend_suggestion/friend_suggestions.cpp:53
next →1–100 of 655, ranked by callers