refac/test/Tests for available functions

quivero · Feb 10, 2022 · 68c07f9 · 68c07f9
1 parent 2ccb99f
commit 68c07f9
Show file tree

Hide file tree

Showing 169 changed files with 98 additions and 56 deletions.
diff --git a/.babelrc b/.babelrc
diff --git a/.eslintrc.cjs b/.eslintrc.cjs
diff --git a/.gitignore b/.gitignore
diff --git a/.pre-commit-config.yaml b/.pre-commit-config.yaml
diff --git a/README.md b/README.md
diff --git a/algorithms/bellman-ford/README.md b/algorithms/bellman-ford/README.md
diff --git a/algorithms/bellman-ford/__test__/bellmanFord.test.js b/algorithms/bellman-ford/__test__/bellmanFord.test.js
diff --git a/algorithms/bellman-ford/bellmanFord.js b/algorithms/bellman-ford/bellmanFord.js
diff --git a/algorithms/breadth-first-search/README.md b/algorithms/breadth-first-search/README.md
diff --git a/algorithms/breadth-first-search/__test__/breadthFirstSearch.test.js b/algorithms/breadth-first-search/__test__/breadthFirstSearch.test.js
diff --git a/algorithms/breadth-first-search/breadthFirstSearch.js b/algorithms/breadth-first-search/breadthFirstSearch.js
diff --git a/algorithms/bridges/README.md b/algorithms/bridges/README.md
diff --git a/algorithms/bridges/__test__/graphBridges.test.js b/algorithms/bridges/__test__/graphBridges.test.js
diff --git a/algorithms/bridges/graphBridges.js b/algorithms/bridges/graphBridges.js
@@ -1,4 +1,4 @@
-import depthFirstSearch from '../depth-first-search/depthFirstSearch';
+import depthFirstSearch from '../depth-first-search/depthFirstSearch.js';
 
 /**
  * Helper class for visited vertex metadata.

diff --git a/algorithms/depth-first-search/README.md b/algorithms/depth-first-search/README.md
diff --git a/algorithms/depth-first-search/__test__/depthFirstSearch.test.js b/algorithms/depth-first-search/__test__/depthFirstSearch.test.js
diff --git a/algorithms/depth-first-search/depthFirstSearch.js b/algorithms/depth-first-search/depthFirstSearch.js
diff --git a/algorithms/detect-cycle/__test__/detectDirectedCycle.test.js b/algorithms/detect-cycle/__test__/detectDirectedCycle.test.js
diff --git a/algorithms/detect-cycle/__test__/detectUndirectedCycle.test.js b/algorithms/detect-cycle/__test__/detectUndirectedCycle.test.js
diff --git a/algorithms/detect-cycle/detectDirectedCycle.js b/algorithms/detect-cycle/detectDirectedCycle.js
diff --git a/algorithms/detect-cycle/detectUndirectedCycle.js b/algorithms/detect-cycle/detectUndirectedCycle.js
diff --git a/algorithms/detect-cycle/detectUndirectedCycleUsingDisjointSet.js b/algorithms/detect-cycle/detectUndirectedCycleUsingDisjointSet.js
diff --git a/algorithms/dijkstra/README.md b/algorithms/dijkstra/README.md
diff --git a/algorithms/dijkstra/__test__/dijkstra.test.js b/algorithms/dijkstra/__test__/dijkstra.test.js
diff --git a/algorithms/dijkstra/dijkstra.js b/algorithms/dijkstra/dijkstra.js
diff --git a/algorithms/eulerian-path/README.md b/algorithms/eulerian-path/README.md
diff --git a/algorithms/eulerian-path/__test__/eulerianPath.test.js b/algorithms/eulerian-path/__test__/eulerianPath.test.js
@@ -3,8 +3,14 @@ import GraphEdge from '../../../data-structures/graph/GraphEdge';
 import Graph from '../../../data-structures/graph/Graph';
 import eulerianPath from '../eulerianPath';
 
+console.warn = jest.fn();
+
+beforeEach(() => {
+  console.warn.mockClear();
+});
+
 describe('eulerianPath', () => {
-  it('should throw an error when graph is not Eulerian', () => {
+  it('should throw an warning on console when graph is not Eulerian', () => {
     function findEulerianPathInNotEulerianGraph() {
       const vertexA = new GraphVertex('A');
       const vertexB = new GraphVertex('B');
@@ -21,16 +27,12 @@ describe('eulerianPath', () => {
       const graph = new Graph();
 
       graph
-        .addEdge(edgeAB)
-        .addEdge(edgeAC)
-        .addEdge(edgeBC)
-        .addEdge(edgeBD)
-        .addEdge(edgeCE);
+        .addEdges([edgeAB, edgeAC, edgeBC, edgeBD, edgeCE]);
 
       eulerianPath(graph);
+
+      expect(console.warn).toHaveBeenCalledTimes(1);
     }
-
-    expect(findEulerianPathInNotEulerianGraph).toThrowError();
   });
 
   it('should find Eulerian Circuit in graph', () => {
@@ -56,16 +58,8 @@ describe('eulerianPath', () => {
     const graph = new Graph();
 
     graph
-      .addEdge(edgeAB)
-      .addEdge(edgeAE)
-      .addEdge(edgeAF)
-      .addEdge(edgeAG)
-      .addEdge(edgeGF)
-      .addEdge(edgeBE)
-      .addEdge(edgeEB)
-      .addEdge(edgeBC)
-      .addEdge(edgeED)
-      .addEdge(edgeCD);
+      .addEdges([edgeAB, edgeAE, edgeAF, edgeAG, edgeGF, 
+                edgeBE, edgeEB, edgeBC, edgeED, edgeCD]);
 
     const graphEdgesCount = graph.getAllEdges().length;
 

diff --git a/algorithms/eulerian-path/eulerianPath.js b/algorithms/eulerian-path/eulerianPath.js
@@ -1,4 +1,4 @@
-import graphBridges from '../bridges/graphBridges';
+import graphBridges from '../bridges/graphBridges.js';
 
 /**
  * Fleury's algorithm of finding Eulerian Path (visit all graph edges exactly once).
@@ -36,9 +36,10 @@ export default function eulerianPath(graph) {
   // If not all vertices have even degree then graph must contain only two odd-degree
   // vertices in order to have Euler Path.
   const isCircuit = !Object.values(oddRankVertices).length;
-
+  
   if (!isCircuit && Object.values(oddRankVertices).length !== 2) {
-    throw new Error('Eulerian path must contain two odd-ranked vertices');
+    console.warn('Warning: Eulerian path must contain two odd-ranked vertices');
+    return [];
   }
 
   // Pick start vertex for traversal.

diff --git a/algorithms/floyd-warshall/README.md b/algorithms/floyd-warshall/README.md
diff --git a/algorithms/floyd-warshall/__test__/floydWarshall.test.js b/algorithms/floyd-warshall/__test__/floydWarshall.test.js
diff --git a/algorithms/floyd-warshall/floydWarshall.js b/algorithms/floyd-warshall/floydWarshall.js
diff --git a/algorithms/hamiltonian-cycle/README.md b/algorithms/hamiltonian-cycle/README.md
diff --git a/algorithms/hamiltonian-cycle/__test__/hamiltonianCycle.test.js b/algorithms/hamiltonian-cycle/__test__/hamiltonianCycle.test.js
diff --git a/algorithms/hamiltonian-cycle/hamiltonianCycle.js b/algorithms/hamiltonian-cycle/hamiltonianCycle.js
diff --git a/algorithms/kruskal/README.md b/algorithms/kruskal/README.md
diff --git a/algorithms/kruskal/__test__/kruskal.test.js b/algorithms/kruskal/__test__/kruskal.test.js
diff --git a/algorithms/kruskal/kruskal.js b/algorithms/kruskal/kruskal.js
diff --git a/algorithms/prim/README.md b/algorithms/prim/README.md
diff --git a/algorithms/prim/__test__/prim.test.js b/algorithms/prim/__test__/prim.test.js
diff --git a/algorithms/prim/prim.js b/algorithms/prim/prim.js
diff --git a/algorithms/sorting/Sort.js b/algorithms/sorting/Sort.js
diff --git a/algorithms/sorting/SortTester.js b/algorithms/sorting/SortTester.js
diff --git a/algorithms/sorting/__test__/Sort.test.js b/algorithms/sorting/__test__/Sort.test.js
diff --git a/algorithms/sorting/bubble-sort/BubbleSort.js b/algorithms/sorting/bubble-sort/BubbleSort.js
diff --git a/algorithms/sorting/bubble-sort/README.md b/algorithms/sorting/bubble-sort/README.md
diff --git a/algorithms/sorting/bubble-sort/README.pt-BR.md b/algorithms/sorting/bubble-sort/README.pt-BR.md
diff --git a/algorithms/sorting/bubble-sort/__test__/BubbleSort.test.js b/algorithms/sorting/bubble-sort/__test__/BubbleSort.test.js
diff --git a/algorithms/sorting/counting-sort/CountingSort.js b/algorithms/sorting/counting-sort/CountingSort.js
diff --git a/algorithms/sorting/counting-sort/README.md b/algorithms/sorting/counting-sort/README.md
diff --git a/algorithms/sorting/counting-sort/__test__/CountingSort.test.js b/algorithms/sorting/counting-sort/__test__/CountingSort.test.js
diff --git a/algorithms/sorting/heap-sort/HeapSort.js b/algorithms/sorting/heap-sort/HeapSort.js
diff --git a/algorithms/sorting/heap-sort/README.md b/algorithms/sorting/heap-sort/README.md
diff --git a/algorithms/sorting/heap-sort/__test__/HeapSort.test.js b/algorithms/sorting/heap-sort/__test__/HeapSort.test.js
diff --git a/algorithms/sorting/insertion-sort/InsertionSort.js b/algorithms/sorting/insertion-sort/InsertionSort.js
diff --git a/algorithms/sorting/insertion-sort/README.md b/algorithms/sorting/insertion-sort/README.md
diff --git a/algorithms/sorting/insertion-sort/__test__/InsertionSort.test.js b/algorithms/sorting/insertion-sort/__test__/InsertionSort.test.js
diff --git a/algorithms/sorting/merge-sort/MergeSort.js b/algorithms/sorting/merge-sort/MergeSort.js
diff --git a/algorithms/sorting/merge-sort/README.md b/algorithms/sorting/merge-sort/README.md
diff --git a/algorithms/sorting/merge-sort/__test__/MergeSort.test.js b/algorithms/sorting/merge-sort/__test__/MergeSort.test.js
diff --git a/algorithms/sorting/quick-sort/QuickSort.js b/algorithms/sorting/quick-sort/QuickSort.js
diff --git a/algorithms/sorting/quick-sort/QuickSortInPlace.js b/algorithms/sorting/quick-sort/QuickSortInPlace.js
diff --git a/algorithms/sorting/quick-sort/README.md b/algorithms/sorting/quick-sort/README.md
diff --git a/algorithms/sorting/quick-sort/__test__/QuickSort.test.js b/algorithms/sorting/quick-sort/__test__/QuickSort.test.js
diff --git a/algorithms/sorting/quick-sort/__test__/QuickSortInPlace.test.js b/algorithms/sorting/quick-sort/__test__/QuickSortInPlace.test.js
diff --git a/algorithms/sorting/radix-sort/README.md b/algorithms/sorting/radix-sort/README.md
diff --git a/algorithms/sorting/radix-sort/RadixSort.js b/algorithms/sorting/radix-sort/RadixSort.js
diff --git a/algorithms/sorting/radix-sort/__test__/RadixSort.test.js b/algorithms/sorting/radix-sort/__test__/RadixSort.test.js
diff --git a/algorithms/sorting/selection-sort/README.md b/algorithms/sorting/selection-sort/README.md
diff --git a/algorithms/sorting/selection-sort/SelectionSort.js b/algorithms/sorting/selection-sort/SelectionSort.js
diff --git a/algorithms/sorting/selection-sort/__test__/SelectionSort.test.js b/algorithms/sorting/selection-sort/__test__/SelectionSort.test.js
diff --git a/algorithms/sorting/shell-sort/README.md b/algorithms/sorting/shell-sort/README.md
diff --git a/algorithms/sorting/shell-sort/ShellSort.js b/algorithms/sorting/shell-sort/ShellSort.js
diff --git a/algorithms/sorting/shell-sort/__test__/ShellSort.test.js b/algorithms/sorting/shell-sort/__test__/ShellSort.test.js
diff --git a/algorithms/strongly-connected-components/README.md b/algorithms/strongly-connected-components/README.md
diff --git a/algorithms/strongly-connected-components/__test__/stronglyConnectedComponents.test.js b/algorithms/strongly-connected-components/__test__/stronglyConnectedComponents.test.js
diff --git a/algorithms/strongly-connected-components/stronglyConnectedComponents.js b/algorithms/strongly-connected-components/stronglyConnectedComponents.js
@@ -1,5 +1,5 @@
-import Stack from '../../data-structures/stack/Stack';
-import depthFirstSearch from '../depth-first-search/depthFirstSearch';
+import Stack from '../../data-structures/stack/Stack.js';
+import depthFirstSearch from '../depth-first-search/depthFirstSearch.js';
 
 /**
  * @param {Graph} graph
@@ -8,7 +8,7 @@ import depthFirstSearch from '../depth-first-search/depthFirstSearch';
 function getVerticesSortedByDfsFinishTime(graph) {
   // Set of all visited vertices during DFS pass.
   const visitedVerticesSet = {};
-
+  
   // Stack of vertices by finish time.
   // All vertices in this stack are ordered by finished time in decreasing order.
   // Vertex that has been finished first will be at the bottom of the stack and

diff --git a/algorithms/topological-sorting/README.md b/algorithms/topological-sorting/README.md
diff --git a/algorithms/topological-sorting/__test__/topologicalSort.test.js b/algorithms/topological-sorting/__test__/topologicalSort.test.js
diff --git a/algorithms/topological-sorting/topologicalSort.js b/algorithms/topological-sorting/topologicalSort.js
diff --git a/algorithms/travelling-salesman/README.md b/algorithms/travelling-salesman/README.md
diff --git a/algorithms/travelling-salesman/__test__/bfTravellingSalesman.test.js b/algorithms/travelling-salesman/__test__/bfTravellingSalesman.test.js
diff --git a/algorithms/travelling-salesman/bfTravellingSalesman.js b/algorithms/travelling-salesman/bfTravellingSalesman.js
diff --git a/app.yaml b/app.yaml
diff --git a/data-structures/disjoint-set/DisjointSet.js b/data-structures/disjoint-set/DisjointSet.js
diff --git a/data-structures/disjoint-set/DisjointSetItem.js b/data-structures/disjoint-set/DisjointSetItem.js
diff --git a/data-structures/disjoint-set/README.md b/data-structures/disjoint-set/README.md
diff --git a/data-structures/disjoint-set/README.pt-BR.md b/data-structures/disjoint-set/README.pt-BR.md
diff --git a/data-structures/disjoint-set/README.ru-RU.md b/data-structures/disjoint-set/README.ru-RU.md
diff --git a/data-structures/disjoint-set/__test__/DisjointSet.test.js b/data-structures/disjoint-set/__test__/DisjointSet.test.js
diff --git a/data-structures/disjoint-set/__test__/DisjointSetItem.test.js b/data-structures/disjoint-set/__test__/DisjointSetItem.test.js
diff --git a/data-structures/graph/Graph.js b/data-structures/graph/Graph.js
@@ -1,5 +1,8 @@
 import Iter from 'es-iter';
 import _ from 'lodash';
+
+import stronglyConnectedComponents from '../../algorithms/strongly-connected-components/stronglyConnectedComponents.js';
+import eulerianPath from '../../algorithms/eulerian-path/eulerianPath.js';
 import depthFirstSearch from '../../algorithms/depth-first-search/depthFirstSearch.js';
 import VisitMetadata from './VisitMetadata.js';
 
@@ -438,7 +441,7 @@ export default class Graph {
     low[v] = preorder[v];
 
     for (let i = 0; i < adjList[v].length; i += 1) {
-      w = adjList[v][i];
+      let w = adjList[v][i];
       if (preorder[w] === -1) {
         this.#bridgesUtil(v, w, preorder, low, counter, bridges);
 
@@ -826,9 +829,13 @@ export default class Graph {
       adjacency_list: this.getAdjacencyList(),
       loose_nodes: this.looseNodes(),
       orphan_nodes: this.orphanNodes(),
+      articulation_nodes: this.articulationVertices(),
       bridges: this.bridges(),
       is_cyclic,
       ...is_cyclic && { all_cycles: this.cyclicPaths() },
+      is_eulerian: is_eulerian,
+      ...is_eulerian && { eulerian_path: this.getEulerianPath() },
+      is_connected: this.isConnected(),
     };
   }
 

diff --git a/data-structures/graph/GraphEdge.js b/data-structures/graph/GraphEdge.js
diff --git a/data-structures/graph/GraphVertex.js b/data-structures/graph/GraphVertex.js
diff --git a/data-structures/graph/README.md b/data-structures/graph/README.md
diff --git a/data-structures/graph/README.pt-BR.md b/data-structures/graph/README.pt-BR.md
diff --git a/data-structures/graph/README.ru-RU.md b/data-structures/graph/README.ru-RU.md
diff --git a/data-structures/graph/README.zh-CN.md b/data-structures/graph/README.zh-CN.md
diff --git a/data-structures/graph/VisitMetadata.js b/data-structures/graph/VisitMetadata.js
diff --git a/data-structures/graph/__test__/Graph.test.js b/data-structures/graph/__test__/Graph.test.js
@@ -513,7 +513,7 @@ describe('Graph', () => {
     const D = new GraphVertex('D');
     const E = new GraphVertex('E');
     const F = new GraphVertex('F');
-
+    
     // Vertices
     const AB = new GraphEdge(A, B);
     const BC = new GraphEdge(B, C);

diff --git a/data-structures/graph/__test__/GraphEdge.test.js b/data-structures/graph/__test__/GraphEdge.test.js
diff --git a/data-structures/graph/__test__/GraphVertex.test.js b/data-structures/graph/__test__/GraphVertex.test.js
diff --git a/data-structures/heap/Heap.js b/data-structures/heap/Heap.js
diff --git a/data-structures/heap/MaxHeap.js b/data-structures/heap/MaxHeap.js
diff --git a/data-structures/heap/MinHeap.js b/data-structures/heap/MinHeap.js
diff --git a/data-structures/heap/README.fr-FR.md b/data-structures/heap/README.fr-FR.md
diff --git a/data-structures/heap/README.ja-JP.md b/data-structures/heap/README.ja-JP.md
diff --git a/data-structures/heap/README.md b/data-structures/heap/README.md
diff --git a/data-structures/heap/README.pt-BR.md b/data-structures/heap/README.pt-BR.md
diff --git a/data-structures/heap/README.ru-RU.md b/data-structures/heap/README.ru-RU.md
diff --git a/data-structures/heap/README.zh-CN.md b/data-structures/heap/README.zh-CN.md
diff --git a/data-structures/heap/__test__/Heap.test.js b/data-structures/heap/__test__/Heap.test.js
diff --git a/data-structures/heap/__test__/MaxHeap.test.js b/data-structures/heap/__test__/MaxHeap.test.js
diff --git a/data-structures/heap/__test__/MinHeap.test.js b/data-structures/heap/__test__/MinHeap.test.js
diff --git a/data-structures/linked-list/LinkedList.js b/data-structures/linked-list/LinkedList.js
diff --git a/data-structures/linked-list/LinkedListNode.js b/data-structures/linked-list/LinkedListNode.js
diff --git a/data-structures/linked-list/README.es-ES.md b/data-structures/linked-list/README.es-ES.md
diff --git a/data-structures/linked-list/README.ja-JP.md b/data-structures/linked-list/README.ja-JP.md
diff --git a/data-structures/linked-list/README.ko-KR.md b/data-structures/linked-list/README.ko-KR.md
diff --git a/data-structures/linked-list/README.md b/data-structures/linked-list/README.md
diff --git a/data-structures/linked-list/README.pt-BR.md b/data-structures/linked-list/README.pt-BR.md
diff --git a/data-structures/linked-list/README.ru-RU.md b/data-structures/linked-list/README.ru-RU.md
diff --git a/data-structures/linked-list/README.zh-CN.md b/data-structures/linked-list/README.zh-CN.md
diff --git a/data-structures/linked-list/__test__/LinkedList.test.js b/data-structures/linked-list/__test__/LinkedList.test.js
diff --git a/data-structures/linked-list/__test__/LinkedListNode.test.js b/data-structures/linked-list/__test__/LinkedListNode.test.js
diff --git a/data-structures/priority-queue/PriorityQueue.js b/data-structures/priority-queue/PriorityQueue.js
diff --git a/data-structures/priority-queue/README.fr-FR.md b/data-structures/priority-queue/README.fr-FR.md
diff --git a/data-structures/priority-queue/README.ja-JP.md b/data-structures/priority-queue/README.ja-JP.md
diff --git a/data-structures/priority-queue/README.md b/data-structures/priority-queue/README.md
diff --git a/data-structures/priority-queue/README.pt-BR.md b/data-structures/priority-queue/README.pt-BR.md
diff --git a/data-structures/priority-queue/README.ru-RU.md b/data-structures/priority-queue/README.ru-RU.md
diff --git a/data-structures/priority-queue/README.zh-CN.md b/data-structures/priority-queue/README.zh-CN.md
diff --git a/data-structures/priority-queue/__test__/PriorityQueue.test.js b/data-structures/priority-queue/__test__/PriorityQueue.test.js
diff --git a/data-structures/queue/Queue.js b/data-structures/queue/Queue.js
diff --git a/data-structures/queue/README.fr-FR.md b/data-structures/queue/README.fr-FR.md
diff --git a/data-structures/queue/README.ja-JP.md b/data-structures/queue/README.ja-JP.md
diff --git a/data-structures/queue/README.md b/data-structures/queue/README.md
diff --git a/data-structures/queue/README.pt-BR.md b/data-structures/queue/README.pt-BR.md
diff --git a/data-structures/queue/README.ru-RU.md b/data-structures/queue/README.ru-RU.md
diff --git a/data-structures/queue/README.zh-CN.md b/data-structures/queue/README.zh-CN.md
diff --git a/data-structures/queue/__test__/Queue.test.js b/data-structures/queue/__test__/Queue.test.js
diff --git a/data-structures/stack/README.fr-FR.md b/data-structures/stack/README.fr-FR.md
diff --git a/data-structures/stack/README.ja-JP.md b/data-structures/stack/README.ja-JP.md
diff --git a/data-structures/stack/README.md b/data-structures/stack/README.md
diff --git a/data-structures/stack/README.pt-BR.md b/data-structures/stack/README.pt-BR.md
diff --git a/data-structures/stack/README.ru-RU.md b/data-structures/stack/README.ru-RU.md
diff --git a/data-structures/stack/README.zh-CN.md b/data-structures/stack/README.zh-CN.md
diff --git a/data-structures/stack/Stack.js b/data-structures/stack/Stack.js
diff --git a/data-structures/stack/__test__/Stack.test.js b/data-structures/stack/__test__/Stack.test.js
diff --git a/jest.config.js b/jest.config.js
diff --git a/package.json b/package.json
diff --git a/samples/blueprints/DemandasEspontaneas.json b/samples/blueprints/DemandasEspontaneas.json
diff --git a/samples/blueprints/POC_userTask.json b/samples/blueprints/POC_userTask.json
diff --git a/samples/blueprints/activitySchemaValidation.json b/samples/blueprints/activitySchemaValidation.json
diff --git a/samples/blueprints/basic.json b/samples/blueprints/basic.json
diff --git a/samples/blueprints/customNode.json b/samples/blueprints/customNode.json
diff --git a/samples/blueprints/environmentVariables.json b/samples/blueprints/environmentVariables.json
diff --git a/samples/blueprints/findProcess.json b/samples/blueprints/findProcess.json
diff --git a/samples/blueprints/indexProcess.json b/samples/blueprints/indexProcess.json
diff --git a/samples/blueprints/notifyUserTask.json b/samples/blueprints/notifyUserTask.json
diff --git a/samples/blueprints/precious.json b/samples/blueprints/precious.json
diff --git a/samples/blueprints/scriptNode.json b/samples/blueprints/scriptNode.json
diff --git a/samples/blueprints/singleUserTask.json b/samples/blueprints/singleUserTask.json
diff --git a/samples/blueprints/timer.json b/samples/blueprints/timer.json
diff --git a/server.js b/server.js
@@ -30,12 +30,11 @@ app.get('/', (req, res) => {
   // Driver program
   // Create a sample graph
 
-  // let parseBlueprintToGraph();
   const bps_root = './samples/blueprints/';
   const blueprints_fnames = fs.readdirSync(bps_root);
 
-  const READ_ALL_BPS = true;
-  const blueprint_fname = 'DemandasEspontaneas.json';
+  const READ_ALL_BPS = false;
+  const blueprint_fname = 'precious.json';
 
   const graphs = [];
   const descriptions = [];
@@ -44,7 +43,7 @@ app.get('/', (req, res) => {
     for (let i = 0; i < blueprints_fnames.length; i++) {
       const fname = bps_root + blueprints_fnames[i];
       const blueprint_i = require(fname);
-
+      
       // let graph_i = parseBlueprintToGraph(blueprint_i);
       descriptions.push(fromStartToFinishCombsAcyclicPaths(blueprint_i));
     }
@@ -53,11 +52,11 @@ app.get('/', (req, res) => {
   } else {
     const fname = bps_root + blueprint_fname;
     const blueprint_i = require(fname);
-
+    
     const graph = parseBlueprintToGraph(blueprint_i);
-    const route_describe = fromStartToFinishAcyclicPaths(blueprint_i, '1', '91');
-
-    res.send(fromStartToFinishCombsAcyclicPaths(blueprint_i));
+    const route_describe = fromStartToFinishCombsAcyclicPaths(blueprint_i);
+    
+    res.send(graph.getEulerianPath());
   }
 });
 // [END app]
diff --git a/utils/arrays/__test__/arrays.test.js b/utils/arrays/__test__/arrays.test.js
@@ -3,6 +3,7 @@ import {
   cyclicSort,
   isCyclicEqual,
   getUniques,
+  extendedVenn
 } from '../arrays';
 
 console.error = jest.fn();
@@ -43,3 +44,36 @@ describe('Array', () => {
     expect(console.error).toHaveBeenCalledTimes(1);
   });
 });
+
+describe('Extended venn diagram', () => {
+  it('Validate information from Extended Venn Diagram', () => {
+    let list_1=[1, 2, 3, 4, 5];
+    let list_2=[4, 5, 6, 7];
+
+    expect(extendedVenn([list_1, list_2])).toEqual({
+      '0,1':[4, 5],
+      '0':[1, 2, 3],
+      '1':[6, 7]
+    });
+  });
+
+  it('Validate non-intersection from Extended Venn Diagram', () => {
+    let list_1=[1, 2, 3];
+    let list_2=[4, 5, 6];
+
+    expect(extendedVenn([list_1, list_2])).toEqual({
+      '0':[1, 2, 3],
+      '1':[4, 5, 6]
+    });
+  });
+
+  it('Validate empty exclusivity from Extended Venn Diagram', () => {
+    let list_1=[1, 2, 3, 4, 5, 6];
+    let list_2=[4, 5, 6];
+
+    expect(extendedVenn([list_1, list_2])).toEqual({
+      '0':[1, 2, 3],
+      '0,1':[4, 5, 6]
+    });
+  });
+})
diff --git a/utils/arrays/arrays.js b/utils/arrays/arrays.js
@@ -63,37 +63,29 @@ export const extendedVenn = (sets) => {
           Set.prototype.has,
           new Set(acc),
         ));
-
+      
       // No intersection means no exclusive value
       if (comb_sets_inter.length === 0) {
         break;
       }
 
-      const ev_keys_i_to_n = [];
-      Object
-        .keys(extended_venn)
-        .forEach(
-          (key) => {
-            if (key.split(',').length >= i) {
-              ev_keys_i_to_n.push(key);
-            }
-          },
-        );
+      const ev_keys_i_to_n = Object.keys(extended_venn);
 
       // Intersection of elements
-      comb_sets_union = ev_keys_i_to_n.length === 0 ? []
-        : ev_keys_i_to_n.reduce((acc, key) => [
-          ...new Set(
-            [
-              ...acc,
-              ...extended_venn[key],
-            ],
-          )], []);
+      comb_sets_union = 
+        ev_keys_i_to_n.length === 0 ? []
+          : ev_keys_i_to_n.reduce((acc, key) => [
+            ...new Set(
+              [
+                ...acc,
+                ...extended_venn[key],
+              ],
+            )], []);
 
       // Exclusive combination set elements
       comb_sets_excl = _.difference(comb_sets_inter, comb_sets_union);
-
-      if (comb_sets_inter.length !== 0) {
+      
+      if (comb_sets_excl.length !== 0) {
         extended_venn[comb_keys.toString()] = comb_sets_excl;
       }
     }

diff --git a/utils/comparator/Comparator.js b/utils/comparator/Comparator.js
diff --git a/utils/comparator/__test__/Comparator.test.js b/utils/comparator/__test__/Comparator.test.js
diff --git a/utils/workflow/parsers.js b/utils/workflow/parsers.js
@@ -110,6 +110,21 @@ export const fromStartToFinishAcyclicPaths = (blueprint, start_key, finish_key)
   const start_id = vertices_keys_to_indices[start_key];
   const finish_id = vertices_keys_to_indices[finish_key];
 
+  let is_undefined=false;
+  if (start_id === undefined) {
+    console.warn(`Warning: Claimed start vertex id ${start_key} is not available within nodes`);
+    is_undefined=true;
+  }
+
+  if (finish_id === undefined) {
+    console.warn(`Warning: Claimed finish vertex id ${finish_key} is not available within nodes`);
+    is_undefined=true;
+  }
+
+  if(is_undefined){
+    return [];
+  }
+
   if (getAllIndexes(orphanNodes, start_id).length === 0) {
     console.warn(`Vertex id ${start_id} is not a start node! Detected start nodes: ${orphanNodes}`);