Types & classes — github.com/TheGeekiestOne/Coursera-Data-Structures-and-Algorithms-Specialization

CodeHub MCPcopy Create free account

hub / github.com/TheGeekiestOne/Coursera-Data-Structures-and-Algorithms-Specialization / types & classes

Types & classes110 in github.com/TheGeekiestOne/Coursera-Data-Structures-and-Algorithms-Specialization

⨍ Functions 655◇ Types & classes 110

↓ 15 callersClassEdge

Course 4 - Algorithms on Strings/assignment 3/suffix_tree_from_array/SuffixTreeFromArray.java:27

↓ 3 callersClassNode

Course 4 - Algorithms on Strings/assignment 1/non_shared_substring/non_shared_substring.cpp:35

↓ 3 callersClassNode

Course 4 - Algorithms on Strings/assignment 1/suffix_tree/suffix_tree.cpp:31

↓ 2 callersClassNode

Node structure to use in the priority_queue supporting Prim's algorithm

Course 3 - Algorithms on Graphs/week5_mst/1_connecting_points/connecting_points.cpp:28

↓ 2 callersClassNode

Node structure to use in the priority_queue supporting Dijkstra's algorithm

Course 3 - Algorithms on Graphs/week4_paths2/1_dijkstra/dijkstra.cpp:19

↓ 2 callersClassNumber

structure to support undefined number and avoid overflow issues

Course 3 - Algorithms on Graphs/week4_paths2/3_shortest_paths/shortest_paths.cpp:17

↓ 2 callersClassPoint

Course 1 - Algorithmic Toolbox/week4_divide_and_conquer/6_closest_points/closest.py:19

↓ 1 callersClassDatabase

Course 2 - Data Structures/week2_priority_queues_and_disjoint_sets/3_merging_tables/merging_tables.py:4

↓ 1 callersClassNode

Course 2 - Data Structures/week4_binary_search_trees/2_is_bst/is_bst.cpp:28

↓ 1 callersClassNode

Course 2 - Data Structures/week4_binary_search_trees/3_is_bst_advanced/is_bst_hard.cpp:21

↓ 1 callersClassQuery

Course 2 - Data Structures/week3_hash_tables/2_hash_chains/hash_chains.py:3

↓ 1 callersClassQuery

Course 2 - Data Structures/week3_hash_tables/1_phone_book/phone_book.py:3

↓ 1 callersClassQueryProcessor

Course 2 - Data Structures/week3_hash_tables/2_hash_chains/hash_chains.py:13

↓ 1 callersClassResult

dummy pair structure to contain the results of the Bellman-Ford algorithm

Course 3 - Algorithms on Graphs/week4_paths2/3_shortest_paths/shortest_paths.cpp:60

↓ 1 callersClassRope

Course 2 - Data Structures/week4_binary_search_trees/5_rope/rope.py:5

↓ 1 callersClassSegment

Course 1 - Algorithmic Toolbox/week3_greedy_algorithms/5_collecting_signatures/covering_segments.cpp:8

↓ 1 callersClassShortcut

Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_small-and-large.cpp:176

↓ 1 callersClassSolver

Course 2 - Data Structures/week3_hash_tables/4_substring_equality/substring_equality.kt:1

↓ 1 callersClassSolver

Course 2 - Data Structures/week3_hash_tables/4_substring_equality/substring_equality.py:5

↓ 1 callersClassStackWithMax

Course 2 - Data Structures/week1_basic_data_structures/4_stack_with_max/stack_with_max_naive.py:4

↓ 1 callersClassTreeOrders

Course 2 - Data Structures/week4_binary_search_trees/1_tree_traversals/tree-orders.py:7

↓ 1 callersClassVertex

Course 2 - Data Structures/week4_binary_search_trees/4_set_range_sum/set_range_sum.py:8

Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_with_coords/dist_with_coords.cpp:18

ClassBWMatching

Course 4 - Algorithms on Strings/assignment 2/bwmatching/bwmatching.cpp:37

ClassBidijkstra

Course 3 - Algorithms on Graphs/Advanced Shortest Path/friend_suggestion/friend_suggestion.cpp:23

ClassBinaryTree

Course 2 - Data Structures/week4_binary_search_trees/1_tree_traversals/tree-orders.cpp:22

Course 2 - Data Structures/week1_basic_data_structures/1_brackets_in_code/check_brackets.cpp:8

ClassContractionHierarchies

Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_small-and-large.cpp:174

Class for directed Graphs

Course 3 - Algorithms on Graphs/week2_decomposition2/1_acyclicity/acyclicity.cpp:15

Class for directed Graphs

Course 3 - Algorithms on Graphs/week2_decomposition2/2_toposort/toposort.cpp:17

Class for directed Graphs

Course 3 - Algorithms on Graphs/week2_decomposition2/3_strongly_connected/strongly_connected.cpp:17

ClassDisjointSets

Course 2 - Data Structures/week2_priority_queues_and_disjoint_sets/3_merging_tables/merging_tables.cpp:24

ClassDisjointSets

Course 3 - Algorithms on Graphs/week5_mst/2_clustering/clustering.cpp:42

ClassDisjointSetsElement

Course 2 - Data Structures/week2_priority_queues_and_disjoint_sets/3_merging_tables/merging_tables.cpp:13

ClassDistPreprocessLarge

Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_large/DistPreprocessLarge.java:6

ClassDistPreprocessSmall

Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_small/DistPreprocessSmall.java:6

ClassDistWithCoords

Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_with_coords/DistWithCoords.java:7

Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_large/DistPreprocessLarge.java:113

Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_with_coords/DistWithCoords.java:65

Course 3 - Algorithms on Graphs/Advanced Shortest Path/friend_suggestion/FriendSuggestion.java:65

Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_small/DistPreprocessSmall.java:113

Course 3 - Algorithms on Graphs/Advanced Shortest Path/travelling_salesman_problem/TravellingSalesmanProblem.java:113

ClassFastScanner

Course 4 - Algorithms on Strings/assignment 3/kmp/KnuthMorrisPratt.java:7

ClassFastScanner

Course 4 - Algorithms on Strings/assignment 3/suffix_tree_from_array/SuffixTreeFromArray.java:7

ClassFastScanner

Course 4 - Algorithms on Strings/assignment 3/suffix_array_long/SuffixArrayLong.java:6

ClassFastScanner

Course 3 - Algorithms on Graphs/Advanced Shortest Path/travelling_salesman_problem/TravellingSalesmanProblem.java:151

ClassFriendSuggestion

Course 3 - Algorithms on Graphs/Advanced Shortest Path/friend_suggestion/FriendSuggestion.java:6

Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_small-and-large.cpp:35

Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_large/dist_preprocess_large.cpp:11

Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_with_coords/dist_with_coords-aStar.cpp:27

Course 3 - Algorithms on Graphs/Advanced Shortest Path/friend_suggestion/friend_suggestions.cpp:27

Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_small/dist_preprocess_small.cpp:11

Course 3 - Algorithms on Graphs/Advanced Shortest Path/travelling_salesman_problem/travelling_salesman_problem.cpp:11

Course 3 - Algorithms on Graphs/week3_paths1/2_bipartite/bipartite.cpp:14

Course 3 - Algorithms on Graphs/week3_paths1/1_bfs/bfs.cpp:13

ClassHeapBuilder

Course 2 - Data Structures/week2_priority_queues_and_disjoint_sets/1_make_heap/build_heap.cpp:22

ClassHeapBuilder

Course 2 - Data Structures/week2_priority_queues_and_disjoint_sets/1_make_heap/build_heap - Copy.cpp:12

Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_large/DistPreprocessLarge.java:7

Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_with_coords/DistWithCoords.java:8

Course 3 - Algorithms on Graphs/Advanced Shortest Path/friend_suggestion/FriendSuggestion.java:7

Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_small/DistPreprocessSmall.java:7

Course 3 - Algorithms on Graphs/Advanced Shortest Path/travelling_salesman_problem/TravellingSalesmanProblem.java:7

ClassKnuthMorrisPratt

Course 4 - Algorithms on Strings/assignment 3/kmp/KnuthMorrisPratt.java:6

Course 4 - Algorithms on Strings/assignment 2/suffix_array/suffix_array.cpp:44

Course 4 - Algorithms on Strings/assignment 1/trie_matching/trie_matching.py:6

Course 4 - Algorithms on Strings/assignment 1/trie_matching_extended/trie_matching_extended.py:6

Course 4 - Algorithms on Strings/assignment 1/trie_matching_extended/trie_matching_extended.cpp:13

EnumNodeProperties

Course 4 - Algorithms on Strings/assignment 1/non_shared_substring/non_shared_substring.cpp:17

A structure to represent a Point in 2D plane

Course 1 - Algorithmic Toolbox/week4_divide_and_conquer/6_closest_points/closest.cpp:40

Course 3 - Algorithms on Graphs/week5_mst/1_connecting_points/connecting_points.cpp:19

Course 3 - Algorithms on Graphs/week5_mst/2_clustering/clustering.cpp:20

Course 4 - Algorithms on Strings/assignment 1/trie_matching/starters_by_learners/trie_matching.cs:7

Course 4 - Algorithms on Strings/assignment 1/trie/starters_by_learners/trie.cs:7

Course 1 - Algorithmic Toolbox/week1_programming_challenges/1_sum_of_two_digits/APlusB.cs:5

Course 2 - Data Structures/week3_hash_tables/2_hash_chains/hash_chains.cpp:17

Course 2 - Data Structures/week3_hash_tables/1_phone_book/phone_book.cpp:20

ClassQueryProcessor

Course 2 - Data Structures/week3_hash_tables/2_hash_chains/hash_chains.cpp:22

Course 2 - Data Structures/week4_binary_search_trees/5_rope/rope.cpp:201

Course 3 - Algorithms on Graphs/week5_mst/2_clustering/clustering.cpp:35

Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_large/DistPreprocessLarge.java:133

Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_large/dist_preprocess_large.cpp:149

Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_small/DistPreprocessSmall.java:133

Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_small/dist_preprocess_small.cpp:149

Course 3 - Algorithms on Graphs/Advanced Shortest Path/travelling_salesman_problem/travelling_salesman_problem.cpp:149

Course 3 - Algorithms on Graphs/Advanced Shortest Path/travelling_salesman_problem/TravellingSalesmanProblem.java:133

Course 2 - Data Structures/week3_hash_tables/4_substring_equality/substring_equality.cpp:5

Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_large/dist_preprocess_large.cpp:38

Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_small/dist_preprocess_small.cpp:38

Course 3 - Algorithms on Graphs/Advanced Shortest Path/travelling_salesman_problem/travelling_salesman_problem.cpp:38

Course 4 - Algorithms on Strings/assignment 3/suffix_array_long/SuffixArrayLong.java:25

ClassSuffixArrayLong

Course 4 - Algorithms on Strings/assignment 3/suffix_array_long/SuffixArrayLong.java:5

ClassSuffixArrayMatching

Course 4 - Algorithms on Strings/assignment 3/suffix_array_matching/SuffixArrayMatching.java:8

ClassSuffixTree

Course 4 - Algorithms on Strings/assignment 2/suffix_array/suffix_array.cpp:35

ClassSuffixTree

Course 4 - Algorithms on Strings/assignment 1/non_shared_substring/non_shared_substring.cpp:24

ClassSuffixTree

Course 4 - Algorithms on Strings/assignment 1/suffix_tree/suffix_tree.cpp:22

ClassSuffixTreeFromArray

Course 4 - Algorithms on Strings/assignment 3/suffix_tree_from_array/SuffixTreeFromArray.java:6

Course 2 - Data Structures/week2_priority_queues_and_disjoint_sets/2_job_queue/job_queue.cpp:23

ClassTravellingSalesmanProblem

Course 3 - Algorithms on Graphs/Advanced Shortest Path/travelling_salesman_problem/TravellingSalesmanProblem.java:6

Vertex of a splay tree

Course 2 - Data Structures/week4_binary_search_trees/5_rope/rope.cpp:20

Vertex of a splay tree

Course 2 - Data Structures/week4_binary_search_trees/4_set_range_sum/set_range_sum.cpp:14

next →1–100 of 110, ranked by callers