cypress-xray-plugin/src/util/graph/algorithms/sort.js

A Cypress plugin for uploading test results to Xray (test management for Jira)

"use strict";
Object.defineProperty(exports, "__esModule", { value: true });
exports.computeTopologicalOrder = computeTopologicalOrder;
exports.traverse = traverse;
const queue_1 = require("../../queue/queue");
/**
 * Computes a topological order for all vertices contained in a directed graph.
 *
 * The computed order is not guaranteed to be stable, i.e. two vertices with the same topological
 * depth may share the same index.
 *
 * @param graph - the graph
 * @returns a mapping of vertices to their index in the computed order
 */
function computeTopologicalOrder(graph) {
    const distances = new Map();
    const queue = new queue_1.Queue();
    for (const vertex of graph.getVertices()) {
        if (!graph.hasIncoming(vertex)) {
            queue.enqueue(vertex);
        }
    }
    while (!queue.isEmpty()) {
        const source = queue.dequeue();
        let sourceDistance = distances.get(source);
        if (sourceDistance === undefined) {
            sourceDistance = 0;
            distances.set(source, sourceDistance);
        }
        for (const outgoingEdge of graph.getOutgoing(source)) {
            const destination = outgoingEdge.getDestination();
            const destinationDistance = distances.get(outgoingEdge.getDestination());
            if (!destinationDistance || destinationDistance < sourceDistance + 1) {
                if (!queue.has(destination)) {
                    queue.enqueue(destination);
                }
                distances.set(destination, sourceDistance + 1);
            }
        }
    }
    return distances;
}
function* traverse(graph, direction) {
    const queue = new queue_1.Queue();
    for (const vertex of graph.getVertices()) {
        if ((direction === "top-down" && !graph.hasIncoming(vertex)) ||
            (direction === "bottom-up" && !graph.hasOutgoing(vertex))) {
            queue.enqueue(vertex);
        }
    }
    while (!queue.isEmpty()) {
        const vertex = queue.dequeue();
        yield vertex;
        switch (direction) {
            case "top-down": {
                for (const successor of graph.getSuccessors(vertex)) {
                    queue.enqueue(successor);
                }
                break;
            }
            case "bottom-up": {
                for (const predecessor of graph.getPredecessors(vertex)) {
                    queue.enqueue(predecessor);
                }
                break;
            }
        }
    }
}