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.
Bidirectional searchGraphDirected graphGraph rewritingBeam searchAdjacency listReverse-delete algorithmGraph theoryClique problemDistanceReachabilityAdjacency matrixIterative deepening a*Cycle detectionKarger's algorithmShortest path problemPermutation graphSpanning treePath graphGraph edit distanceJohnson's algorithmTopological sortingNeighbourhoodAlgebraic graph theoryRange searchingComplete graphHamiltonian pathLongest path problemKnowledge graphTree decompositionModular decompositionMixed graphGraph labelingCycle basisData-flow analysisGraph homologyGraph isomorphism problemPathPolytreeDijkstra's algorithmInduced pathTreeEdge coverBest-first searchEuler tour techniqueColor-codingSubgraph isomorphism problemBinary search algorithmBreadth-first searchFibonacci search techniqueOrientationLoop dependence analysisAnt colony optimization algorithmsEulerian pathRoot-finding algorithmsDependency graphGraph statePrim's algorithmEdge coloringGraph neural networkClosed graph theoremCartesian treeComputational geometryGraph fourier transformKosaraju's algorithmEdge-transitive graphGraph homomorphismFlow networkFeedback arc setMaximum weight matchingDegree matrixChromatic polynomialKruskal's algorithmCanadian traveller problemFeedback vertex setMoral graphGraph coloringAlgorithmBrute-force searchInduced subgraphGradient descentSearch problemTopological graph theoryModel checkingSocial network analysisLine detectionRecursionRegular graphLine graphBetweenness centralityCayley graphJunction tree algorithmDual graphTime complexityIntersection numberBacktracking line searchNetwork theoryGraph partitionRange minimum queryGraph bandwidth