import { Graph } from '../../graphlib/graph.mjs';
import { maxRank, buildLayerMatrix } from '../util.mjs';
import { addSubgraphConstraints } from './add-subgraph-constraints.mjs';
import { buildLayerGraph } from './build-layer-graph.mjs';
import { crossCount } from './cross-count.mjs';
import { initOrder } from './init-order.mjs';
import { sortSubgraph } from './sort-subgraph.mjs';
import range from '../../../../../../lodash-es@4.17.23/node_modules/lodash-es/range.mjs';
import cloneDeep from '../../../../../../lodash-es@4.17.23/node_modules/lodash-es/cloneDeep.mjs';
import map from '../../../../../../lodash-es@4.17.23/node_modules/lodash-es/map.mjs';
import forEach from '../../../../../../lodash-es@4.17.23/node_modules/lodash-es/forEach.mjs';

/*
 * Applies heuristics to minimize edge crossings in the graph and sets the best
 * order solution as an order attribute on each node.
 *
 * Pre-conditions:
 *
 *    1. Graph must be DAG
 *    2. Graph nodes must be objects with a "rank" attribute
 *    3. Graph edges must have the "weight" attribute
 *
 * Post-conditions:
 *
 *    1. Graph nodes will have an "order" attribute based on the results of the
 *       algorithm.
 */
function order(g) {
  var maxRank$1 = maxRank(g),
    downLayerGraphs = buildLayerGraphs(g, range(1, maxRank$1 + 1), 'inEdges'),
    upLayerGraphs = buildLayerGraphs(g, range(maxRank$1 - 1, -1, -1), 'outEdges');

  var layering = initOrder(g);
  assignOrder(g, layering);

  var bestCC = Number.POSITIVE_INFINITY,
    best;

  for (var i = 0, lastBest = 0; lastBest < 4; ++i, ++lastBest) {
    sweepLayerGraphs(i % 2 ? downLayerGraphs : upLayerGraphs, i % 4 >= 2);

    layering = buildLayerMatrix(g);
    var cc = crossCount(g, layering);
    if (cc < bestCC) {
      lastBest = 0;
      best = cloneDeep(layering);
      bestCC = cc;
    }
  }

  assignOrder(g, best);
}

function buildLayerGraphs(g, ranks, relationship) {
  return map(ranks, function (rank) {
    return buildLayerGraph(g, rank, relationship);
  });
}

function sweepLayerGraphs(layerGraphs, biasRight) {
  var cg = new Graph();
  forEach(layerGraphs, function (lg) {
    var root = lg.graph().root;
    var sorted = sortSubgraph(lg, root, cg, biasRight);
    forEach(sorted.vs, function (v, i) {
      lg.node(v).order = i;
    });
    addSubgraphConstraints(lg, cg, sorted.vs);
  });
}

function assignOrder(g, layering) {
  forEach(layering, function (layer) {
    forEach(layer, function (v, i) {
      g.node(v).order = i;
    });
  });
}

export { order };
