import { feasibleTree } from "./src-dagre-rank-feasible-tree.js";
import { networkSimplex } from "./src-dagre-rank-network-simplex.js";
import { longestPath } from "./src-dagre-rank-util.js";
function rank(g) {
  switch (g.graph().ranker) {
    case "network-simplex":
      networkSimplexRanker(g);
      break;
    case "tight-tree":
      tightTreeRanker(g);
      break;
    case "longest-path":
      longestPathRanker(g);
      break;
    default:
      networkSimplexRanker(g);
  }
}
var longestPathRanker = longestPath;
function tightTreeRanker(g) {
  longestPath(g);
  feasibleTree(g);
}
function networkSimplexRanker(g) {
  networkSimplex(g);
}
export {
  rank
};
//# sourceMappingURL=src-dagre-rank-index.js.map
