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.
Longest path problemDistanceEuclidean shortest pathGraph bandwidthMaximum weight matchingMinimum spanning treeBidirectional searchCloseness centralityReverse-delete algorithmIterative deepening a*Minimum cutPath graphTransitive reductionJohnson's algorithmPathAverage path lengthBetweenness centralityTreeEuclidean minimum spanning treeDijkstra's algorithmClosest pair of points problemConnectivityComplete graphShortest path faster algorithmIntersection numberMinimum bottleneck spanning treeDirected graphInduced pathEdmonds' algorithmRoute inspection problemMinimum k-cutPermutation graphMenger's theoremMedian graphK shortest path routingSubgraph isomorphism problemClique problemCycle basisPlanarity testingEdge-transitive graphTree decompositionGeodesicMinimum-cost flow problemSmallest-circle problemInduced subgraphGeometric medianGraph partitionGraph traversalGraph isomorphism problemMixed graphHamiltonian path problemDistance from a point to a lineSpanning treeDense graphTravelling salesman problemCycle graphNeighbourhoodReachabilityEdge coverEdge coloringLongest common subsequence problemComplement graphQuantum graphFlow networkCanadian traveller problemGraph theoryConvex hull of a simple polygonEuclidean distanceMinimum bounding box algorithmsTrajectory optimizationSnake-in-the-boxSymmetric graphModular decompositionDimensionBipartite graphPolytreeAlgebraic graph theoryFeedback vertex setHamiltonian pathEdge contractionNetwork flow problemBiconnected componentTriangle inequalityPrim's algorithmOptimization problemFeedback arc setAnt colony optimization algorithmsMatrix chain multiplicationGraphMoral graphKruskal's algorithmLongest increasing subsequencePolygon triangulationSpectral graph theoryKarger's algorithmClique coverGraph edit distanceMetric k-centerLine graphCycle