title: Understanding the minimax/maximin paths (Floyd-Warshall)
body: <p>I've implemented the Floyd-Warshall-Algorithm to solve the All-pairs shortest path problem. Now I found out I can also compute the minimax or maximin path with easy modifications. But I don't understand what the result means (what a minimax path is). I found some <a href="https://vo.homelinux.org/wiki/code/FloydWarshall" rel="noreferrer">explanations</a> on the web, but they are confusing me.</p>
  <blockquote>
  <p>Minimax - Minimax in graph problems involves finding a path between two nodes that minimizes the maximum cost along the path.</p>
  <p>Maximin - the other way around from Minimax - here you have problems where you need to find the path the maximizes the minimum cost along a path.</p>
  </blockquote>
  <p>Could someone please try to give an other explanation or an example?</p>