A river-freight desk asks three questions: the shortest tow route between locks, which lock is a bottleneck hub, and which clusters of landings trade mostly among themselves. Which graph-task families are those?

Short Explanation

Shortest tow route is path finding. A bottleneck hub is centrality. Clusters that trade among themselves are community detection. Those are graph-task families, not boosting or prompting.

Full Explanation

Shortest route is a path task, a bottleneck hub is centrality, and clusters that trade among themselves are communities. Those are conceptual graph families, not boosting, prompting, or datacenter ops.

×