Function blossom has a Cognitive Complexity of 375 (exceeds 5 allowed). Consider refactoring.

Open

export function blossom(CHECK_OPTIMUM, CHECK_DELTA) {
    // Check delta2/delta3 computation after every substage;
    // only works on integer weights, slows down the algorithm to O(n^4).
    if (CHECK_DELTA === undefined) CHECK_DELTA = false;

• Read up
  Read up

Function blossom has 563 lines of code (exceeds 25 allowed). Consider refactoring.

Open

export function blossom(CHECK_OPTIMUM, CHECK_DELTA) {
    // Check delta2/delta3 computation after every substage;
    // only works on integer weights, slows down the algorithm to O(n^4).
    if (CHECK_DELTA === undefined) CHECK_DELTA = false;

Function maxWeightMatching has 558 lines of code (exceeds 25 allowed). Consider refactoring.

Open

    const maxWeightMatching = (edges, maxCardinality = false) => {
        // Vertices are numbered 0 .. (nvertex-1).
        // Non-trivial blossoms are numbered nvertex .. (2*nvertex-1)
        //
        // Edges are numbered 0 .. (nedge-1).

File blossom.js has 576 lines of code (exceeds 250 allowed). Consider refactoring.

Open

import assert from 'assert';

import {blossomEdges} from './blossomEdges.js';
import {blossomLeaves} from './blossomLeaves.js';
import {checkDelta2} from './checkDelta2.js';

Function checkDelta3 has a Cognitive Complexity of 34 (exceeds 5 allowed). Consider refactoring.

Open

export const checkDelta3 = ({
    nvertex,
    edges,
    blossomparent,
    blossomchilds,

• Read up
  Read up

Function addBlossom has 102 lines of code (exceeds 25 allowed). Consider refactoring.

Open

        const addBlossom = (base, k) => {
            let v = edges[k][0];
            let w = edges[k][1];
            const bb = inblossom[base];
            let bv = inblossom[v];

Function checkDelta2 has a Cognitive Complexity of 25 (exceeds 5 allowed). Consider refactoring.

Open

export const checkDelta2 = ({
    nvertex,
    neighbend,
    label,
    endpoint,

• Read up
  Read up

Function verifyOptimum has a Cognitive Complexity of 24 (exceeds 5 allowed). Consider refactoring.

Open

export const verifyOptimum = ({
    nvertex,
    edges,
    maxCardinality,
    nedge,

• Read up
  Read up

Function expandBlossom has 78 lines of code (exceeds 25 allowed). Consider refactoring.

Open

        const expandBlossom = (b, endstage) => {
            console.debug(
                'DEBUG: expandBlossom(' + b + ',' + endstage + ') ' + blossomchilds[b],
            );
            // Convert sub-blossoms into top-level blossoms.

Function augmentBlossom has 45 lines of code (exceeds 25 allowed). Consider refactoring.

Open

        const augmentBlossom = (b, v) => {
            console.debug('DEBUG: augmentBlossom(' + b + ',' + v + ')');
            // Bubble up through the blossom tree from vertex v to an immediate
            // sub-blossom of b.
            let j;

Function scanBlossom has 30 lines of code (exceeds 25 allowed). Consider refactoring.

Open

        const scanBlossom = (v, w) => {
            console.debug('DEBUG: scanBlossom(' + v + ',' + w + ')');
            // Trace back from v and w, placing breadcrumbs as we go.
            const path = [];
            let base = -1;

Avoid deeply nested control flow statements.

Open

                        if (inblossom[v] === inblossom[w]) {
                            // This edge is internal to a blossom; ignore it
                            continue;
                        }

Avoid deeply nested control flow statements.

Open

                        if (!allowedge[k]) {
                            kslack = slack(k);
                            if (kslack <= 0) {
                                // Edge k has zero slack => it is allowable
                                allowedge[k] = true;

Avoid deeply nested control flow statements.

Open

                    if (bk === -1 || d < bd) {
                        bk = k;
                        bd = d;
                    }

Avoid deeply nested control flow statements.

Open

                        if (allowedge[k]) {
                            if (label[inblossom[w]] === 0) {
                                // (C1) w is a free vertex;
                                // label w with T and label its mate with S (R12).
                                assignLabel(w, 2, p ^ 1);

Avoid deeply nested control flow statements.

Open

                        if (deltatype === -1 || d < delta) {
                            delta = d;
                            deltatype = 2;
                            deltaedge = bestedge[v];
                        }

Avoid deeply nested control flow statements.

Open

                    if (inblossom[w] !== b && label[inblossom[w]] === 1) {
                        const d = slack(k);
                        if (bk === -1 || d < bd) {
                            bk = k;
                            bd = d;

Avoid deeply nested control flow statements.

Open

                        if (deltatype === -1 || d < delta) {
                            delta = d;
                            deltatype = 3;
                            deltaedge = bestedge[b];
                        }

Avoid deeply nested control flow statements.

Open

                        if (label[b] === 1) {
                            // Top-level S-blossom: z = z + 2*delta
                            dualvar[b] += delta;
                        } else if (label[b] === 2) {
                            // Top-level T-blossom: z = z - 2*delta

Function statistics has a Cognitive Complexity of 6 (exceeds 5 allowed). Consider refactoring.

Open

export const statistics = (edges) => {
    const nedge = edges.length;
    let nvertex = 0;
    let maxweight = 0;

• Read up
  Read up