Capire i percorsi di Minimax / Maximin (Floyd-Warshall)

Question

Ho implementato l'algoritmo Floyd-Warshall per risolvere il problema del percorso più breve di tutti i paia.Ora ho scoperto che posso anche calcolare il percorso di minimax o massimin con facili modifiche.Ma non capisco cosa significa il risultato (cosa è un percorso di minimax).Ho trovato alcuni spiegazioni sul web, ma mi stanno confondendo.

.

MINIMAX - MINIMAX IN PROBLEMI DI GRAVI I PROGRASCONO DI PORTARE UN PERCORSO TRA DUE DODE CHE RIMUOLIZZA IL COSTO MASSIMO LUNGO PACETTO.

Maximin - L'altro modo in giro da MINIMAX - qui hai problemi in cui è necessario trovare il percorso il percorso il costo minimo lungo un percorso.

potrebbe qualcuno per favore prova a dare un'altra spiegazione o un esempio?

Answer 1

To understand maximin paths (often called bottleneck paths) in a graph, consider the following problem. You have a road map of a country as a graph where each node represents an intersection and each edge represents a road. Each road has a weight limit, and if you drive a truck that exceeds the limit over that road it will break. You have a truck that you want to drive from some start location to some end location, and you want to put the maximum possible amount of weight on it. Given this, what path should you drive the truck in order to send the maximum possible weight?

If you think about this problem, for any path that you take in the graph, the maximum weight you can send along that path is going to be determined by the edge on that path with the minimum capacity. As a result, you want to find the path from the start to the destination whose minimum-capacity edge is maximized. The path with this property is called the maximin path or bottleneck path, and can be found with a straightforward set of modifications to mot shortest-path algorithms.

The minimax path represents the opposite idea - the path between two points that minimizes the maximum edge capacity.

Hope this helps!