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.
DistanceCloseness centralityShortest path problemDegree distributionBetweenness centralityPath lengthSmall-world networkLongest path problemAverage-case complexityAverageEppstein's algorithmPathConnected graphAverage absolute deviationK shortest path routingDijkstra's algorithmEfficiencyConnectivityFlow networkArithmetic meanDirected graphLink analysisData-rate unitsMedian graphEuclidean distanceMinimum spanning treeGeodesicJohnson's algorithmSpanMetricGeometric meanMean squareRound-trip delayArithmetic-geometric meanDirected pathPath graphMeanBreadthMean absolute deviationDistance correlationCycle basisCrossing numberTreeInduced pathNetwork topologyEqual-cost multi-path routingIterative deepening a*Perpendicular distanceMean squared errorResidence timeEuclidean minimum spanning treeSuurballe's algorithmComplete graphMean absolute differenceWalkPacket delay variationBetweennessClustering coefficientDistance from a point to a lineEigenvector centralityEuclidean shortest pathGraph edit distanceRing networkReciprocityLoopGeometric medianPythagorean additionMedianBidirectional searchCorrelationMeasureSpatial networkRangeAverage revenue per userQuantum graphPopulation meanGeometric standard deviationCentralityNetwork theoryPercolation thresholdAverage treatment effectCorrelation functionRing topologyCounting measurePermutation graphFloyd-warshall algorithmLink predictionStandard errorDense graphShortest path faster algorithmAxial ratioBellman-ford algorithmFeedback arc setDistance matrixSpherical meanDistance from a point to a planeAdministrative distanceRandom walkMesh networkIntersection number