Types & classes — github.com/VamsiSangam/theoryofprogramming

CodeHub MCPcopy Create free account

hub / github.com/VamsiSangam/theoryofprogramming / types & classes

Types & classes72 in github.com/VamsiSangam/theoryofprogramming

⨍ Functions 258◇ Types & classes 72

ClassAdjacencyList

Graph Theory/Adjcacency List/C#/AdjacencyList.cs:17

ClassAdjacencyListDemo

Graph Theory/Adjcacency List/Java/AdjacencyList.java:29

ClassBidirectionalSearch

Artificial Intelligence/Bidirectional Search/Java/BidirectionalSearch.java:15

ClassBinarySearch

Searching Algorithms/Binary Search Algorithm/Java/BinarySearch.java:12

Custom comparator for priority queue

Graph Theory/Dijkstra's Algorithm/C++/dijkstras-algorithm.cpp:22

Custom comparator for priority queue

Graph Theory/Prim's Algorithm/C++/prims-algorithm-using-stl.cpp:27

ClassDijkstraAlgorithm

Graph Theory/Dijkstra's Algorithm/Java/DijkstraAlgorithm.java:12

Graph Theory/Adjcacency List/C/adjacency-list.c:15

Graph Theory/Adjcacency List/C/adjacency-list.c:17

Used for enqueing edges into priority queue

Graph Theory/Prim's Algorithm/C++/prims-algorithm-using-stl.cpp:20

ClassEditDistance

Dynamic Programming/Edit Distance/Java/EditDistance.java:14

Graph Theory/Breadth First Search Algorithm/Java/Graph.java:15

Graph Theory/Depth First Search Algorithm/Java/Graph.java:15

ClassIterativeDeepeningDepthFirstSearch

Artificial Intelligence/Iterative Deepening Depth First Search/Java/IterativeDeepeningDepthFirstSearch.java:11

ClassJumpSearch

Searching Algorithms/Jump Search Algorithm/Java/JumpSearch.java:12

ClassKadanesAlgorithm

Dynamic Programming/Kadane's Algorithm/Java/KadanesAlgorithm.java:14

ClassMazeSolver

Backtracking/Maze Solver/Java/MazeSolver.java:13

Sorting Algorithms/Merge Sort Algorithm/Java/MergeSort.java:15

ClassMiniMaxAlgorithm

Artificial Intelligence/MiniMax Algorithm/Java/MiniMaxAlgorithm.java:14

ClassMiniMaxWithAlphaBetaPruning

Artificial Intelligence/MiniMax Algorithm with Alpha-Beta Pruning/Java/MiniMaxWithAlphaBetaPruning.java:14

Artificial Intelligence/MiniMax Algorithm/Java/MiniMaxAlgorithm.java:232

ClassNaryTreeNode

Tree Data Structures/N-ary Tree/Java/NaryTreeNode.java:13

Tree Data Structures/Trie Tree/C++/trie-tree-spoj-dict.cpp:22

Tree Data Structures/Trie Tree/C++/trie-tree-spoj-dict.cpp:24

Tree Data Structures/Compressed Trie Tree/Java/Trie.java:168

Graph Theory/Adjcacency List/Java/AdjacencyList.java:13

ClassOptimisedEditDistance

Dynamic Programming/Edit Distance/Java/OptimisedEditDistance.java:14

ClassOptimisedJumpSearch

Searching Algorithms/Jump Search Algorithm/Java/OptimisedJumpSearch.java:12

Searching Algorithms/Jump Search Algorithm/Java/OptimisedJumpSearch.java:60

Searching Algorithms/Jump Search Algorithm/C/optimised-jump-search.c:16

ClassPrimsAlgorithm

Graph Theory/Prim's Algorithm/Java/PrimsAlgorithm.java:12

Sorting Algorithms/Quick Sort Algorithm/Java/QuickSort.java:14

ClassQuickSortDijsktra

Sorting Algorithms/Quick Sort Algorithm/Java/QuickSortDijsktra.java:14

ClassQuickSortDualPivot

Sorting Algorithms/Quick Sort Algorithm/Java/QuickSortDualPivot.java:14

ClassQuickSortRandomPivot

Sorting Algorithms/Quick Sort Algorithm/Java/QuickSortRandomPivot.java:14

Artificial Intelligence/MiniMax Algorithm/Java/MiniMaxAlgorithm.java:221

ClassRodCutting

Dynamic Programming/Rod Cutting/Java/RodCutting.java:13

Tree Data Structures/Trie Tree/Java/Trie.java:191

Tree Data Structures/Compressed Trie Tree/Java/Trie.java:179

Graph Theory/Adjcacency List/C#/AdjacencyList.cs:92

ClassTestNaryTree

Tree Data Structures/N-ary Tree/Java/NaryTreeNode.java:65

Tree Data Structures/Trie Tree/Java/Trie.java:13

Tree Data Structures/Compressed Trie Tree/Java/Trie.java:12

Tree Data Structures/Trie Tree/Java/TrieTreeSimple.java:12

Tree Data Structures/Trie Tree/Java/Trie.java:143

ClassTrieTreeSimple

Tree Data Structures/Trie Tree/Java/TrieTreeSimple.java:18

Graph Theory/Prim's Algorithm/C/prims-algorithm.c:21

Tree Data Structures/Binary Heaps/C++/binary-heap-using-struct.cpp:18

Tree Data Structures/Binary Heaps/C++/binary-heap-using-struct.cpp:21

Tree Data Structures/Trie Tree/C++/trie-tree-spoj-phonelst.cpp:21

Tree Data Structures/Trie Tree/C++/trie-tree-spoj-phonelst.cpp:23

Tree Data Structures/Trie Tree/C++/trie-tree-using-stl.cpp:22

Tree Data Structures/Trie Tree/C++/trie-tree-using-stl.cpp:24

Tree Data Structures/Segment Trees/C/segment-tree.c:15

Tree Data Structures/Segment Trees/C/segment-tree.c:18

Node of the adjacency list

Graph Theory/Dijkstra's Algorithm/C/dijkstras-algorithm-using-binary-heap.c:17

Graph Theory/Dijkstra's Algorithm/C/dijkstras-algorithm-using-binary-heap.c:19

Node of the adjacency list

Graph Theory/Dijkstra's Algorithm/C/dijkstras-algorithm.c:17

Graph Theory/Dijkstra's Algorithm/C/dijkstras-algorithm.c:19

Graph Theory/Snakes and Ladders Game Code/C/snakes-and-ladders.c:15

Graph Theory/Snakes and Ladders Game Code/C/snakes-and-ladders.c:17

Graph Theory/Breadth First Search Algorithm/C/breadth-first-search.c:15

Graph Theory/Breadth First Search Algorithm/C/breadth-first-search.c:17

This is used to construct the Adjacency List

Graph Theory/Bellman Ford Algorithm/C/bellman-ford.c:22

Graph Theory/Bellman Ford Algorithm/C/bellman-ford.c:24

Graph Theory/Prim's Algorithm/C/prims-algorithm.c:15

Graph Theory/Prim's Algorithm/C/prims-algorithm.c:18

Graph Theory/Depth First Search Algorithm/C/depth-first-search.c:15

Graph Theory/Depth First Search Algorithm/C/depth-first-search.c:17

This is used to construct the Shortest Paths to all vertices, as we cannot return multiple values, we use a struct

Graph Theory/Bellman Ford Algorithm/C/bellman-ford.c:30

Tree Data Structures/Binary Heaps/C/binary-heap.c:15

Each element of the priority queue (min heap) is a pair of vertex and a value (its distance)

Graph Theory/Dijkstra's Algorithm/C/dijkstras-algorithm-using-binary-heap.c:24