LeetCode 1334. Find the City With the Smallest Number of Neighbors at a Threshold Distance？？

There are n cities numbered from 0 to n-1. Given the array edges where edges[i] = [fromi, toi, weighti] represents a bidirectional and weighted edge between cities fromi and toi, and given the integer distanceThreshold.

Return the city with the smallest number of cities that are reachable through some path and whose distance is at most distanceThreshold, If there are multiple such cities, return the city with the greatest number.

idea:
have no idea what his talking about good.
but it is actually the problem about shortest path.
use floyd-warshall algorithm