Aplicación del algoritmos de Dijkstra para establecer una agenda de vuelos.

Script
const flights = [
  { from: 'Barcelona', to: 'London', price: 160 },
  { from: 'Barcelona', to: 'Paris', price: 110 },
  { from: 'Paris', to: 'Berlin', price: 90 },
  { from: 'Berlin', to: 'London', price: 120 },
  { from: 'London', to: 'New York', price: 400 },
  { from: 'Berlin', to: 'New York', price: 500 },
  { from: 'Berlin', to: 'Barcelona', price: 140 },
  { from: 'Madrid', to: 'Barcelona', price: 100 },
  { from: 'Madrid', to: 'Paris', price: 90 }
];

function getMinPath(dest, flights, minPaths = {}, minPrice = 0, path = '') {
  const toFlights = flights.filter(flight => flight.from === dest);
  const minFlight = toFlights.reduce((prev, current) => current.price < prev.price ? current : prev);