function minimumLength(graph, u, v) {
  var outEdges = graph.outEdges(u, v);
  if (outEdges.length > 0) {
    return util.max(outEdges.map(function(e) {
      return graph.edge(e).minLen;
    }));
  }

  var inEdges = graph.inEdges(u, v);
  if (inEdges.length > 0) {
    return -util.max(inEdges.map(function(e) {
      return graph.edge(e).minLen;
    }));
  }
}
function minimumLength(graph, u, v) {
  var outEdges = graph.outEdges(u, v);
  if (outEdges.length > 0) {
    return util.max(outEdges.map(function(e) {
      return graph.edge(e).minLen;
    }));
  }

  var inEdges = graph.inEdges(u, v);
  if (inEdges.length > 0) {
    return -util.max(inEdges.map(function(e) {
      return graph.edge(e).minLen;
    }));
  }
}
function minimumLength ( graph , u , v ) { var outEdges = graph . outEdges ( u , v ) ; if ( outEdges . length > 0 ) { return util . max ( outEdges . map ( function ( e ) { return graph . edge ( e ) . minLen ; } ) ) ; } var inEdges = graph . inEdges ( u , v ) ; if ( inEdges . length > 0 ) { return - util . max ( inEdges . map ( function ( e ) { return graph . edge ( e ) . minLen ; } ) ) ; } }
/*
If u and v are connected by some edges in the graph, return the
minimum length of those edges, as a positive number if v succeeds
u and as a negative number if v precedes u.
/ * If u and v are connected by some edges in the graph return the minimum length of those edges as a positive number if v succeeds u and as a negative number if v precedes u .