Sign upLogin

JoeKarlsson/data-structures

View on GitHub
Star
shortest-path/aStar.js

Summary

Maintainability
C
7 hrs
Test Coverage

Function search has a Cognitive Complexity of 29 (exceeds 5 allowed). Consider refactoring.
Open

  search: (graph, start, end, options) => {
    graph.cleanDirty();
    options = options || {};
    const heuristic = options.heuristic || astar.heuristics.manhattan;
    const closest = options.closest || false;
Severity: Minor
Found in shortest-path/aStar.js - About 4 hrs to fix

Cognitive Complexity

Cognitive Complexity is a measure of how difficult a unit of code is to intuitively understand. Unlike Cyclomatic Complexity, which determines how difficult your code will be to test, Cognitive Complexity tells you how difficult your code will be to read and comprehend.

A method's cognitive complexity is based on a few simple rules:

  • Code is not considered more complex when it uses shorthand that the language provides for collapsing multiple statements into one
  • Code is considered more complex for each "break in the linear flow of the code"
  • Code is considered more complex when "flow breaking structures are nested"

Further reading

Function search has 50 lines of code (exceeds 25 allowed). Consider refactoring.
Open

  search: (graph, start, end, options) => {
    graph.cleanDirty();
    options = options || {};
    const heuristic = options.heuristic || astar.heuristics.manhattan;
    const closest = options.closest || false;
Severity: Minor
Found in shortest-path/aStar.js - About 2 hrs to fix

    Avoid deeply nested control flow statements.
    Open

                if (
              neighbor.h < closestNode.h ||
              (neighbor.h === closestNode.h && neighbor.g < closestNode.g)
            ) {
              closestNode = neighbor;
    Severity: Major
    Found in shortest-path/aStar.js - About 45 mins to fix

      There are no issues that match your filters.

      Category
      Status