basicprimitives/src/tasks/transformations/ConnectionsGraphTask.js

Basic Primitives Diagrams for JavaScript - data visualization components library that implements organizational chart and multi-parent dependency diagrams, contains implementations of JavaScript Controls and PDF rendering plugins.

import Graph from '../../algorithms/Graph';

export default function ConnectionsGraphTask(getGraphics, createTransformTask, connectorsOptionTask, visualTreeLevelsTask, extractNestedLayoutsTask, alignDiagramTask, removeLoopsTask) {
  var _data = {
    graph: null,
    nodeid: 0
  };

  function process() {
    var bundles = visualTreeLevelsTask.getBundles(),
      bundles2 = extractNestedLayoutsTask.getBundles(),
      nestedLayoutParentConnectorIds = extractNestedLayoutsTask.getNestedLayoutParentConnectorIds(),
      nestedLayoutBottomConnectorIds = extractNestedLayoutsTask.getNestedLayoutBottomConnectorIds(),
      connectorsOptions = connectorsOptionTask.getOptions(),
      loops = removeLoopsTask != null ? removeLoopsTask.getLoops() : [];

    bundles = bundles.concat(bundles2);

    var data = {
      graph: Graph(),
      nodeid: 0
    };

    var params = {
      treeItemsPositions: alignDiagramTask.getItemsPositions(),
      nestedLayoutParentConnectorIds: nestedLayoutParentConnectorIds,
      nestedLayoutBottomConnectorIds: nestedLayoutBottomConnectorIds,
      transform: createTransformTask.getTransform()
    };

    var options = {
      connectorType: connectorsOptions.connectorType,
      showExtraArrows: connectorsOptions.showExtraArrows,
      bevelSize: connectorsOptions.bevelSize,
      elbowType: connectorsOptions.elbowType
    };

    for (var index = 0, len = bundles.length; index < len; index += 1) {
      var bundle = bundles[index];

      bundle.trace(data, params, options);
    }

    TraceLoops(data.graph, loops, connectorsOptions.extraArrowsMinimumSpace);

    _data = data;

    return true;
  }

  function TraceLoops(graph, loops) {
    var edges = [];
    for(var isOppositeFlow = 1; isOppositeFlow >= 0; isOppositeFlow -=1) {
      for (var index = 0, len = loops.length; index < len; index += 1) {
        var loop = loops[index];
        if(loop.isOppositeFlow == (isOppositeFlow == 1)) {
          graph.getShortestPath(this, loop.from, [loop.to], function (connectorEdge, fromItem, toItem) {
            return connectorEdge.weight;
          }, function (path, to) {
            for (var index2 = 0, len2 = path.length - 1; index2 < len2; index2 += 1) {
              var fromItem = path[index2], toItem = path[index2 + 1];
              var edge = graph.edge(fromItem, toItem);
              if(edge.polyline.length() > 0) {
                edge.isOppositeFlow = (isOppositeFlow == 1);
                edges.push(edge);
              }
            }
          }); //ignore jslint
        }
      }
    }
    for (var index = 0, len = edges.length; index < len; index += 1) {
      var edge = edges[index];
      if(edge.isOppositeFlow) {
        edge.hasArrow = true;
      }
    }
  }

  function getGraph() {
    return _data.graph;
  }

  return {
    process: process,
    getGraph: getGraph
  };
};