revert irrelevant changes

Author: bobbai00

bin/build-services.sh

@@ -28,8 +28,5 @@ rm config-service/target/universal/config-service-*.zip
 unzip computing-unit-managing-service/target/universal/computing-unit-managing-service-*.zip -d target/
 rm computing-unit-managing-service/target/universal/computing-unit-managing-service-*.zip
 
-unzip mcp-service/target/universal/mcp-service-*.zip -d target/
-rm mcp-service/target/universal/mcp-service-*.zip
-
 unzip amber/target/universal/texera-*.zip -d amber/target/
 rm amber/target/universal/texera-*.zip

bin/mcp-service.sh

@@ -18,12 +18,6 @@
  */
 
 module.exports = {
-  resolve: {
-    fallback: {
-      // Minimal polyfill for path (needed by some dependencies)
-      "path": require.resolve("path-browserify"),
-    }
-  },
   module: {
     rules: [
       {

frontend/custom-webpack.config.js

@@ -29,12 +29,6 @@
   display: none;
 }
 
-::ng-deep .action-plan {
-  // Action plan highlights - temporary 5-second visual indicators
-  // Styles are defined inline in JointJS element, but this provides a hook for customization
-  pointer-events: none;
-}
-
 ::ng-deep .hide-worker-count .operator-worker-count {
   display: none;
 }

frontend/src/app/workspace/component/workflow-editor/workflow-editor.component.scss

@@ -919,56 +919,4 @@ export class WorkflowActionService {
   public getHighlightingEnabled() {
     return this.highlightingEnabled;
   }
-
-  /**
-   * Find all operators and links on any upstream path leading to the given destination operator.
-   * Uses BFS to traverse backwards from the destination to find all contributing operators.
-   * @param destinationOperatorId The operator ID to find upstream paths to
-   * @returns Object containing arrays of operator IDs and link IDs on upstream paths
-   */
-  public findUpstreamPath(destinationOperatorId: string): { operators: string[]; links: string[] } {
-    const allLinks = this.getTexeraGraph().getAllLinks();
-
-    // Build reverse adjacency list (from target to source)
-    const reverseAdjacencyMap = new Map<string, Array<{ neighbor: string; linkId: string }>>();
-    allLinks.forEach(link => {
-      const source = link.source.operatorID;
-      const target = link.target.operatorID;
-      if (!reverseAdjacencyMap.has(target)) {
-        reverseAdjacencyMap.set(target, []);
-      }
-      reverseAdjacencyMap.get(target)!.push({ neighbor: source, linkId: link.linkID });
-    });
-
-    // BFS to find all upstream operators and links
-    const queue: string[] = [destinationOperatorId];
-    const visitedOperators = new Set<string>();
-    const allOperatorsOnPaths = new Set<string>();
-    const allLinksOnPaths = new Set<string>();
-
-    allOperatorsOnPaths.add(destinationOperatorId); // Include the destination operator
-
-    while (queue.length > 0) {
-      const current = queue.shift()!;
-
-      if (visitedOperators.has(current)) {
-        continue;
-      }
-      visitedOperators.add(current);
-
-      const upstreamNeighbors = reverseAdjacencyMap.get(current) || [];
-      for (const { neighbor, linkId } of upstreamNeighbors) {
-        allOperatorsOnPaths.add(neighbor);
-        allLinksOnPaths.add(linkId);
-        if (!visitedOperators.has(neighbor)) {
-          queue.push(neighbor);
-        }
-      }
-    }
-
-    return {
-      operators: Array.from(allOperatorsOnPaths),
-      links: Array.from(allLinksOnPaths),
-    };
-  }
 }