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
MethodStlHeap
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_small/dist_preprocess_small.cpp:44
MethodStlHeap
Course 3 - Algorithms on Graphs/Advanced Shortest Path/travelling_salesman_problem/travelling_salesman_problem.cpp:44
MethodSuffix
(String suffix, int start)
Course 4 - Algorithms on Strings/assignment 3/suffix_array_long/SuffixArrayLong.java:29
MethodSuffixTree
Course 4 - Algorithms on Strings/assignment 2/suffix_array/suffix_array.cpp:36
MethodSuffixTree
Course 4 - Algorithms on Strings/assignment 1/non_shared_substring/non_shared_substring.cpp:25
MethodSuffixTree
Course 4 - Algorithms on Strings/assignment 1/suffix_tree/suffix_tree.cpp:23
MethodThreads
Course 2 - Data Structures/week2_priority_queues_and_disjoint_sets/2_job_queue/job_queue.cpp:29
MethodVertex
Course 2 - Data Structures/week4_binary_search_trees/5_rope/rope.cpp:29
MethodVertex
Course 2 - Data Structures/week4_binary_search_trees/4_set_range_sum/set_range_sum.cpp:23
MethodVertexSet
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_large/dist_preprocess_large.cpp:116
MethodVertexSet
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_small/dist_preprocess_small.cpp:116
MethodVertexSet
Course 3 - Algorithms on Graphs/Advanced Shortest Path/travelling_salesman_problem/travelling_salesman_problem.cpp:116
MethodWeightedDiGraph
Course 3 - Algorithms on Graphs/week4_paths2/3_shortest_paths/shortest_paths.cpp:75
MethodWeightedDiGraph
Course 3 - Algorithms on Graphs/week4_paths2/2_negative_cycle/negative_cycle.cpp:22
MethodWeightedDiGraph
Course 3 - Algorithms on Graphs/week4_paths2/1_dijkstra/dijkstra.cpp:34
MethodWriteResponse
Course 2 - Data Structures/week2_priority_queues_and_disjoint_sets/1_make_heap/build_heap.cpp:27
MethodWriteResponse
Course 2 - Data Structures/week2_priority_queues_and_disjoint_sets/1_make_heap/build_heap - Copy.cpp:17
Method__init__
(self)
Course 4 - Algorithms on Strings/assignment 1/trie_matching/trie_matching.py:7
Method__init__
(self)
Course 4 - Algorithms on Strings/assignment 1/trie_matching_extended/trie_matching_extended.py:7
Method__init__
(self, s)
Course 2 - Data Structures/week4_binary_search_trees/5_rope/rope.py:6
Method__init__
(self, key, sum, left, right, parent)
Course 2 - Data Structures/week4_binary_search_trees/4_set_range_sum/set_range_sum.py:9
Method__init__
(self, row_counts)
Course 2 - Data Structures/week2_priority_queues_and_disjoint_sets/3_merging_tables/merging_tables.py:5
Method__init__
(self)
Course 2 - Data Structures/week1_basic_data_structures/4_stack_with_max/stack_with_max_naive.py:5
Method__init__
(self, s)
Course 2 - Data Structures/week3_hash_tables/4_substring_equality/substring_equality.py:6
Method__init__
(self, query)
Course 2 - Data Structures/week3_hash_tables/2_hash_chains/hash_chains.py:5
Method__init__
(self, bucket_count)
Course 2 - Data Structures/week3_hash_tables/2_hash_chains/hash_chains.py:17
Method__init__
(self, query)
Course 2 - Data Structures/week3_hash_tables/1_phone_book/phone_book.py:4
Method__init__
(self, x, y)
Course 1 - Algorithmic Toolbox/week4_divide_and_conquer/6_closest_points/closest.py:20
Method__repr__
(self)
Course 1 - Algorithmic Toolbox/week4_divide_and_conquer/6_closest_points/closest.py:24
Methodadd_directed_edge
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_large/dist_preprocess_large.cpp:184
Methodadd_directed_edge
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_small/dist_preprocess_small.cpp:184
Methodadd_directed_edge
Course 3 - Algorithms on Graphs/Advanced Shortest Path/travelling_salesman_problem/travelling_salesman_problem.cpp:184
Methodadd_edge
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_large/dist_preprocess_large.cpp:189
Methodadd_edge
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_small/dist_preprocess_small.cpp:189
Methodadd_edge
Course 3 - Algorithms on Graphs/Advanced Shortest Path/travelling_salesman_problem/travelling_salesman_problem.cpp:189
Methodadd_edge_to_list
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_large/dist_preprocess_large.cpp:171
Methodadd_edge_to_list
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_small/dist_preprocess_small.cpp:171
Methodadd_edge_to_list
Course 3 - Algorithms on Graphs/Advanced Shortest Path/travelling_salesman_problem/travelling_salesman_problem.cpp:171
Methodadd_node
Course 4 - Algorithms on Strings/assignment 2/suffix_array/suffix_array.cpp:53
Methodadd_node
Course 4 - Algorithms on Strings/assignment 1/non_shared_substring/non_shared_substring.cpp:49
Methodadd_node
Course 4 - Algorithms on Strings/assignment 1/suffix_tree/suffix_tree.cpp:46
Methodadd_nodes_branching
Course 4 - Algorithms on Strings/assignment 2/suffix_array/suffix_array.cpp:60
Methodadd_nodes_branching
Course 4 - Algorithms on Strings/assignment 1/non_shared_substring/non_shared_substring.cpp:55
Methodadd_nodes_branching
Course 4 - Algorithms on Strings/assignment 1/suffix_tree/suffix_tree.cpp:52
Methodapply_shortcut
(Shortcut sc)
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_large/DistPreprocessLarge.java:61
Methodapply_shortcut
(Shortcut sc)
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_small/DistPreprocessSmall.java:61
Methodapply_shortcut
(Shortcut sc)
Course 3 - Algorithms on Graphs/Advanced Shortest Path/travelling_salesman_problem/TravellingSalesmanProblem.java:61
Functionare_matching
(left, right)
Course 2 - Data Structures/week1_basic_data_structures/1_brackets_in_code/check_brackets.py:8
Methodclear
()
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_large/DistPreprocessLarge.java:66
Methodclear
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_large/dist_preprocess_large.cpp:132
Methodclear
()
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_small/DistPreprocessSmall.java:66
Methodclear
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_small/dist_preprocess_small.cpp:132
Methodclear
Course 3 - Algorithms on Graphs/Advanced Shortest Path/travelling_salesman_problem/travelling_salesman_problem.cpp:132
Methodclear
()
Course 3 - Algorithms on Graphs/Advanced Shortest Path/travelling_salesman_problem/TravellingSalesmanProblem.java:66
Methodclear_containers
Course 3 - Algorithms on Graphs/Advanced Shortest Path/friend_suggestion/friend_suggestions.cpp:58
Methodclear_workset
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_with_coords/dist_with_coords-aStar.cpp:51
MethodcompareTo
(Object o)
Course 4 - Algorithms on Strings/assignment 3/suffix_array_long/SuffixArrayLong.java:34
MethodcompareTo
(Entry other)
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_large/DistPreprocessLarge.java:124
MethodcompareTo
(Entry other)
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_with_coords/DistWithCoords.java:76
MethodcompareTo
(Entry other)
Course 3 - Algorithms on Graphs/Advanced Shortest Path/friend_suggestion/FriendSuggestion.java:76
MethodcompareTo
(Entry other)
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_small/DistPreprocessSmall.java:124
MethodcompareTo
(Entry other)
Course 3 - Algorithms on Graphs/Advanced Shortest Path/travelling_salesman_problem/TravellingSalesmanProblem.java:124
FunctioncompareX
Needed to sort array of points according to X coordinate
Course 1 - Algorithmic Toolbox/week4_divide_and_conquer/6_closest_points/closest.cpp:51
FunctioncompareY
Needed to sort array of points according to Y coordinate
Course 1 - Algorithmic Toolbox/week4_divide_and_conquer/6_closest_points/closest.cpp:58
Methodcompute_path
Course 3 - Algorithms on Graphs/Advanced Shortest Path/friend_suggestion/friend_suggestions.cpp:92
Methodcontains_negative_cycle
Course 3 - Algorithms on Graphs/week4_paths2/2_negative_cycle/negative_cycle.cpp:91
Methodcontract_node
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_small-and-large.cpp:293
Functiondfs
(adj, used, order, x)
Course 3 - Algorithms on Graphs/week2_decomposition2/2_toposort/toposort.py:5
Functiondisplay
Course 2 - Data Structures/week4_binary_search_trees/2_is_bst/is_bst.cpp:21
Methoddisplay
Course 3 - Algorithms on Graphs/week2_decomposition2/1_acyclicity/acyclicity.cpp:50
Methoddisplay
Course 3 - Algorithms on Graphs/week2_decomposition2/2_toposort/toposort.cpp:45
Methoddisplay
Course 3 - Algorithms on Graphs/week2_decomposition2/3_strongly_connected/strongly_connected.cpp:60
Methoddo_shortcut
Adds all the shortcuts for the case when node v is contracted, and returns the importance of node v in this case
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_large/dist_preprocess_large.cpp:157
Methoddo_shortcut
Adds all the shortcuts for the case when node v is contracted, and returns the importance of node v in this case
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_small/dist_preprocess_small.cpp:157
Methoddo_shortcut
Adds all the shortcuts for the case when node v is contracted, and returns the importance of node v in this case
Course 3 - Algorithms on Graphs/Advanced Shortest Path/travelling_salesman_problem/travelling_salesman_problem.cpp:157
Methodempty
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_small/dist_preprocess_small.cpp:48
Methodempty
Course 3 - Algorithms on Graphs/Advanced Shortest Path/travelling_salesman_problem/travelling_salesman_problem.cpp:48
Functionfast_count_segments
Course 1 - Algorithmic Toolbox/week4_divide_and_conquer/5_organizing_a_lottery/points_and_segments.cpp:6
Methodfastscanner
()
Course 4 - Algorithms on Strings/assignment 3/suffix_array_matching/SuffixArrayMatching.java:13
Methodfinalize
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_large/dist_preprocess_large.cpp:193
Methodfinalize
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_small/dist_preprocess_small.cpp:193
Methodfinalize
Course 3 - Algorithms on Graphs/Advanced Shortest Path/travelling_salesman_problem/travelling_salesman_problem.cpp:193
Functiongcd_naive
Course 1 - Algorithmic Toolbox/week2_algorithmic_warmup/3_greatest_common_divisor/gcd.cpp:11
MethodgetFirstPosition
Course 4 - Algorithms on Strings/assignment 2/bwmatching/bwmatching.cpp:60
MethodgetIndex
Course 4 - Algorithms on Strings/assignment 2/bwmatching/bwmatching.cpp:44
MethodgetParent
Course 2 - Data Structures/week2_priority_queues_and_disjoint_sets/3_merging_tables/merging_tables.cpp:38
MethodgetSymbolsCountByIndex
Course 4 - Algorithms on Strings/assignment 2/bwmatching/bwmatching.cpp:76
Methodget_n
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_large/dist_preprocess_large.cpp:78
Methodget_n
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_small/dist_preprocess_small.cpp:78
Methodget_n
Course 3 - Algorithms on Graphs/Advanced Shortest Path/travelling_salesman_problem/travelling_salesman_problem.cpp:78
Methodget_reverse_post_order
Course 3 - Algorithms on Graphs/week2_decomposition2/3_strongly_connected/strongly_connected.cpp:73
Functiongreater
Course 1 - Algorithmic Toolbox/week6_dynamic_programming2/1_maximum_amount_of_gold/knapsack.cpp:14
Methodhas
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_large/dist_preprocess_large.cpp:129
Methodhas
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_small/dist_preprocess_small.cpp:129
Methodhas
Course 3 - Algorithms on Graphs/Advanced Shortest Path/travelling_salesman_problem/travelling_salesman_problem.cpp:129
Methodhash_func
Course 2 - Data Structures/week3_hash_tables/2_hash_chains/hash_chains.cpp:27
Methodinitialize_nodes_queue
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_small-and-large.cpp:368
MethodisSymbolInTopBottomRange
Course 4 - Algorithms on Strings/assignment 2/bwmatching/bwmatching.cpp:81
MethodleftValue
Course 2 - Data Structures/week2_priority_queues_and_disjoint_sets/1_make_heap/build_heap.cpp:42
FunctionletterToIndex
Course 4 - Algorithms on Strings/assignment 1/trie_matching_extended/trie_matching_extended.cpp:25
← previousnext →401–500 of 655, ranked by callers