MCPcopy Create free account

hub / github.com/VAR-solutions/Algorithms / types & classes

Types & classes712 in github.com/VAR-solutions/Algorithms

⨍ Functions 3,327◇ Types & classes 712
↓ 19 callersClassColour
Searching/binary search/c/test/catch.hpp:5550
↓ 18 callersClassAstar
Searching/8-puzzleProblem/8-puzzleProblem.py:8
↓ 13 callersClasspluralise
Searching/binary search/c/test/catch.hpp:448
↓ 10 callersClassTextAttributes
Searching/binary search/c/test/catch.hpp:4163
↓ 9 callersClassNode
Graphs/BinaryTree/python/binaryTree.py:2
↓ 8 callersClassNode
Tree/right_view_binary_tree/python/right_view.py:2
↓ 7 callersClassText
Searching/binary search/c/test/catch.hpp:4182
↓ 6 callersClassActivity
Greedy Algorithms/Activity Selection/python/activity_selection.py:3
↓ 5 callersClassTestSpecParser
Searching/binary search/c/test/catch.hpp:3719
↓ 4 callersClassAhoCorasick
Other Algorithms/String/python/ahocorasick.py:4
↓ 4 callersClassCasedString
Searching/binary search/c/test/catch.hpp:2983
↓ 4 callersClassNode
Class to create nodes for a linked list
LinkedList/LinkedListModule.py:1
↓ 4 callersClassSummaryColumn
Searching/binary search/c/test/catch.hpp:10978
↓ 4 callersClassToken
Searching/binary search/c/test/catch.hpp:4629
↓ 3 callersClassItem
Greedy Algorithms/Fractional Knapsack/python/fractionalKnapsack.py:2
↓ 3 callersClassNameAndLocation
Searching/binary search/c/test/catch.hpp:6048
↓ 3 callersClassNode
Other Algorithms/AStar/astar.py:2
↓ 3 callersClassNode
A node class for A* Pathfinding
Graphs/A star pathfinding algorithm/Astar.py:11
↓ 2 callersClassArg
Searching/binary search/c/test/catch.hpp:4750
↓ 2 callersClassAssertionInfo
Searching/binary search/c/test/catch.hpp:940
↓ 2 callersClassGraph
Graphs/bfs/python/bfs.py:1
↓ 2 callersClassGroupInfo
Searching/binary search/c/test/catch.hpp:5653
↓ 2 callersClassLinearSearch
Searching/Linear Search/LinearSearchRec.java:5
↓ 2 callersClassNode
data structures/Graph/GraphDFS(Letters).py:1
↓ 2 callersClassNode
data structures/Graph/GraphDFS.py:1
↓ 2 callersClassNode
data structures/linked list/python/Singly-linked-list.py:1
↓ 2 callersStructNode
Tree/Binary Search Tree/go/src/bst.go:7
↓ 2 callersClassReporterConfig
Searching/binary search/c/test/catch.hpp:5611
↓ 2 callersClassSegmentTree
Tree/segment tree/python/segment_tree.py:4
↓ 2 callersClassSession
Searching/binary search/c/test/catch.hpp:7116
↓ 2 callersClassTestCaseStats
Searching/binary search/c/test/catch.hpp:5723
↓ 2 callersClassTestRunStats
Searching/binary search/c/test/catch.hpp:5777
↓ 2 callersClassTimeTravelStack
data structures/stack/python/timeTravelStack.py:7
↓ 2 callersClassTreeNode
Tree/Binary Search Tree/bstree.py:4
↓ 2 callersClassXmlEncode
Searching/binary search/c/test/catch.hpp:9988
↓ 2 callersClassblock
Blockchain/blockchain_algorithm.py:4
↓ 2 callersClassmove
A Structure to hold the two parameters of a move A move has two parameters- 1) pile_index = The index of pile from which stone is
Combinatorial Game Theory/Game of NIM/gameNIM.c:17
↓ 2 callersClasssigaction
Searching/binary search/c/test/catch.hpp:6592
↓ 1 callersClassApprox
Searching/binary search/c/test/catch.hpp:2798
↓ 1 callersClassAssertionResult
Searching/binary search/c/test/catch.hpp:995
↓ 1 callersClassAssertionStats
Searching/binary search/c/test/catch.hpp:5667
↓ 1 callersClassBSTree
Tree/Binary Search Tree/bstree.py:12
↓ 1 callersClassBinarySearch
Only Applies To Sorted Data - Efficient Binary Search in Kotlin by Kendall Jackson
Graphs/BinaryTree/kotlin/binaryKotlin.kt:2
↓ 1 callersClassBinomialHeap
heaps/BinomialHeap/Python/binomial_heap.py:34
↓ 1 callersClassBubbleSort
Sorting/Bubble Sort/Java/BubbleSort.java:3
↓ 1 callersClassBySectionInfo
Searching/binary search/c/test/catch.hpp:9737
↓ 1 callersClassCoinChange
Dynamic Programming/coin change/python/coin_change.py:1
↓ 1 callersClassContainsMatcher
Searching/binary search/c/test/catch.hpp:3005
↓ 1 callersClassCounts
Searching/binary search/c/test/catch.hpp:2065
↓ 1 callersClassEndsWithMatcher
Searching/binary search/c/test/catch.hpp:3013
↓ 1 callersClassEqualsMatcher
Searching/binary search/c/test/catch.hpp:3001
↓ 1 callersClassFilter
Searching/binary search/c/test/catch.hpp:3681
↓ 1 callersClassGraph
Recursive Algorithms/DFS/Python/dfs_graph.py:1
↓ 1 callersClassGraph
data structures/Graph/GraphDictionaries.py:1
↓ 1 callersClassGraph
data structures/Graph/Example/GraphExample.py:12
↓ 1 callersClassGraph
Graphs/check bipartite/Python/checkBipartite.py:4
↓ 1 callersClassGraph
Graphs/ford-fulkerson/python/max_flow.py:6
↓ 1 callersClassGraph
Graphs/bfs/c/bfs.c:21
↓ 1 callersClassGraph
Graphs/Dijkstra Algorithm/python/dijkstra.py:3
↓ 1 callersClassGraph
Graphs/Minimum Spanning Tree/python/MST_kruskal.py:8
↓ 1 callersClassGraph
Graphs/dfs/python/dfs.py:1
↓ 1 callersClassGraph
Backtracking/mcoloring/mcoloring.py:2
↓ 1 callersClassHumanPlayer
Recursive Algorithms/minimax/tic-tac-toe/tictactoe.py:187
↓ 1 callersClassIndexOutOfBoundsException
data structures/Matrix/cpp/Array.h:6
↓ 1 callersClassLinkedGraph
Graphs/Minimum Spanning Tree/C++/data-structures/LinkedGraph.hpp:9
↓ 1 callersClassLinkedList
data structures/linked list/python/linkedlist.py:6
↓ 1 callersClassMiniMaxPlayer
A perfect player that uses minimax to determine best move
Recursive Algorithms/minimax/tic-tac-toe/tictactoe.py:129
↓ 1 callersClassNode
data structures/Graph/GraphAL.py:1
↓ 1 callersClassNode
data structures/Graph/GraphBFS.py:1
↓ 1 callersClassNode
data structures/Graph/Example/GraphExample.py:1
↓ 1 callersClassNode
data structures/linked list/python/Stack_with_Singly_Linked_List.py:1
↓ 1 callersClassNode
data structures/linked list/python/Queue_with_Singly_Linked_List.py:1
↓ 1 callersClassNode
data structures/linked list/python/linkedlist.py:1
↓ 1 callersClassNode
Graphs/BinaryTree/python/binaryTreeFromInfixNPrefix.py:25
↓ 1 callersClassNode
Node in the binomial heap - is as a Node in a forest of binary heaps (which are implemeted as a tree) - holds a value of type T -
heaps/BinomialHeap/Python/binomial_heap.py:12
↓ 1 callersClassNumArray
Tree/segment tree/python/segment_tree.py:12
↓ 1 callersClassOrientedGraph
Graphs/Bellman-ford/python/bellman.py:1
↓ 1 callersClassPile
Sorting/Patience Sorting/Python3/patience_sort.py:5
↓ 1 callersClassQueueUsingArray
data structures/queue/Kotlin/QueueUsingArray.kt:1
↓ 1 callersClassResultBuilder
Searching/binary search/c/test/catch.hpp:1213
↓ 1 callersClassSecantMethod
Numerical Methods/secant_method/python/secant_method.py:1
↓ 1 callersClassSectionStats
Searching/binary search/c/test/catch.hpp:5699
↓ 1 callersClassSourceLineInfo
Searching/binary search/c/test/catch.hpp:457
↓ 1 callersClassStack
data structures/Graph/GraphDFS(Letters).py:12
↓ 1 callersClassStack
data structures/Graph/GraphDFS.py:12
↓ 1 callersClassStack
data structures/stack/python/stack.py:1
↓ 1 callersClassStackUsingArray
data structures/stack/Kotlin/StackUsingArray.kt:1
↓ 1 callersClassStartsWithMatcher
Searching/binary search/c/test/catch.hpp:3009
↓ 1 callersClassSwap
Bit Manipulation/swap/Java/Swap.java:5
↓ 1 callersClassTagAlias
Searching/binary search/c/test/catch.hpp:3132
↓ 1 callersClassTagInfo
Searching/binary search/c/test/catch.hpp:5931
↓ 1 callersClassTestCase
Searching/binary search/c/test/catch.hpp:638
↓ 1 callersClassTestFailureException
Searching/binary search/c/test/catch.hpp:1196
↓ 1 callersClassTestGroupStats
Searching/binary search/c/test/catch.hpp:5751
↓ 1 callersClassTicTacToe
Class that has all necesarry components for a tic tac toe game
Recursive Algorithms/minimax/tic-tac-toe/tictactoe.py:5
↓ 1 callersClassTrackerHasName
Searching/binary search/c/test/catch.hpp:6147
↓ 1 callersClassTrie
data structures/trie/python/trie.py:14
↓ 1 callersClassTrieNode
data structures/trie/python/trie.py:5
↓ 1 callersClassblockchain
Blockchain/blockchain_algorithm.py:15
↓ 1 callersClasscocktailSort
Sorting/Cocktail/C++/Cocktail.cpp:6
next →1–100 of 712, ranked by callers