GitHub - MatthewBieda/DataStructuresandAlgos-in-Cplusplus

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 107 Commits
GraphVis_Reference_Implementations		GraphVis_Reference_Implementations
AVLTree.cpp		AVLTree.cpp
Backtracking.cpp		Backtracking.cpp
Backtracking_Constraints.cpp		Backtracking_Constraints.cpp
BinarySearch.cpp		BinarySearch.cpp
BinarySearchTree.cpp		BinarySearchTree.cpp
Binary_Search.cpp		Binary_Search.cpp
Bit_Tricks.cpp		Bit_Tricks.cpp
Bitmask.cpp		Bitmask.cpp
BubbleSort.cpp		BubbleSort.cpp
Character_Conversion.cpp		Character_Conversion.cpp
CircularLinkedList.cpp		CircularLinkedList.cpp
CountingSort.cpp		CountingSort.cpp
Counting_Sort.cpp		Counting_Sort.cpp
Custom_Hash_Function.cpp		Custom_Hash_Function.cpp
Cycle_Sort.cpp		Cycle_Sort.cpp
DFS_Simple_Recursive.cpp		DFS_Simple_Recursive.cpp
DP_Bitmask.cpp		DP_Bitmask.cpp
DP_Matrix.cpp		DP_Matrix.cpp
DP_Matrix_Optimal_Space.cpp		DP_Matrix_Optimal_Space.cpp
DP_Template.cpp		DP_Template.cpp
DP_Tree.cpp		DP_Tree.cpp
Dijkstra_Heap.cpp		Dijkstra_Heap.cpp
Dijkstra_Old.cpp		Dijkstra_Old.cpp
DoublyLinkedList.cpp		DoublyLinkedList.cpp
Edit_Distance.cpp		Edit_Distance.cpp
Erasing.cpp		Erasing.cpp
Fenwick_Tree.cpp		Fenwick_Tree.cpp
Frequency_Array.cpp		Frequency_Array.cpp
Graph.cpp		Graph.cpp
Heap.cpp		Heap.cpp
InsertionSort.cpp		InsertionSort.cpp
LCS.cpp		LCS.cpp
LIS.cpp		LIS.cpp
LinearSearch.cpp		LinearSearch.cpp
Linked_List_Recursive_MergeSort.cpp		Linked_List_Recursive_MergeSort.cpp
Linked_Lists_Various.cpp		Linked_Lists_Various.cpp
MergeSort.cpp		MergeSort.cpp
Monotonic_Stack_Template.cpp		Monotonic_Stack_Template.cpp
Next_Greater_Element.cpp		Next_Greater_Element.cpp
Prefix_Sum.cpp		Prefix_Sum.cpp
Prefix_Sum_2D.cpp		Prefix_Sum_2D.cpp
Prefix_Sum_Binary_Tree.cpp		Prefix_Sum_Binary_Tree.cpp
QuickSort.cpp		QuickSort.cpp
Quick_Select.cpp		Quick_Select.cpp
README.md		README.md
RadixSort.cpp		RadixSort.cpp
Red_Black_Tree.cpp		Red_Black_Tree.cpp
STL_Priority_Queue.cpp		STL_Priority_Queue.cpp
Segment_Tree.cpp		Segment_Tree.cpp
SelectionSort.cpp		SelectionSort.cpp
Simple_MergeSort.cpp		Simple_MergeSort.cpp
Simple_QuickSort.cpp		Simple_QuickSort.cpp
SinglyLinkedList.cpp		SinglyLinkedList.cpp
Sliding_Window_Fixed.cpp		Sliding_Window_Fixed.cpp
Sliding_Window_Variable.cpp		Sliding_Window_Variable.cpp
Splay_Tree.cpp		Splay_Tree.cpp
Stack.cpp		Stack.cpp
String_Splitting.cpp		String_Splitting.cpp
Trie.cpp		Trie.cpp
Union-Find.cpp		Union-Find.cpp
circular_queue.cpp		circular_queue.cpp
hashmap_complex_values.cpp		hashmap_complex_values.cpp
monotonic_stack.cpp		monotonic_stack.cpp
optimizedBubbleSort.cpp		optimizedBubbleSort.cpp
queue.cpp		queue.cpp
re-rooting.cpp		re-rooting.cpp

Repository files navigation

Notes to self:

A* is just Dijkstra that adopts a heuristic to prune the search space. Dijkstra is like BFS using a priority queue.

Backtracking using constraints to prune the search space in a DFS is very similar to the usage of a heuristic in A* search.

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Repository files navigation

About

Releases

Packages

Languages

MatthewBieda/DataStructuresandAlgos-in-Cplusplus

Folders and files

Latest commit

History

Repository files navigation

About

Resources

Stars

Watchers

Forks

Releases

Packages 0

Languages

Packages