MyFinder is a unique search engine with a simple privacy concept in mind. We log your searches but none of the data, it's that simple.
Best-first searchBreadth-first searchBidirectional searchGraph traversalDepth-first searchIterative deepening a*Eppstein's algorithmKarger's algorithmFibonacci search techniqueBinary search algorithmSearch algorithmReverse-delete algorithmJohnson's algorithmGraphPrim's algorithmTernary searchAnt colony optimization algorithmsFloyd-warshall algorithmJunction tree algorithmClique problemControl-flow graphBacktracking line searchEdmonds' algorithmTrieCycle detectionTree decompositionLongest path problemKosaraju's algorithmMonte carlo tree searchShortest path faster algorithmGraph rewritingKruskal's algorithmRange searchingTree traversalShortest path problemTreapAlpha-beta pruningSearch problemBellman-ford algorithmTabu searchRange minimum queryAdjacency listExpander graphFiduccia-mattheyses algorithmDijkstra's algorithmColor-codingB-treeBlossom algorithmLine searchRegression treeA* search algorithmCycle basisGraph theorySearch data structureCombinatorial optimizationParticle swarm optimizationAvl treeKadane's algorithmAlgebraic graph theoryMaximum weight matchingSegment treeInduced pathBinary space partitioningData-flow analysisFractional cascadingNearest neighbor searchBinary treeAdjacency matrixBiconnected componentBrute-force searchDynamic connectivityMultitreeEuler tour techniqueSuurballe's algorithmLinked data structureBiconjugate gradient methodSnake-in-the-boxBetweenness centralityViterbi algorithmBirchState space searchKnowledge graphCanadian traveller problemActive-set methodNearest-neighbor chain algorithmSpanning treeEvolutionary algorithmGraph stateTree sort3-optMm algorithmDirected graphLink analysisRadix treeModular decompositionTopological sortBinomial heapNested sampling algorithmLinked listString-searching algorithm