ClearML/clearml-web
1
0
Fork 0
mirror of https://github.com/clearml/clearml-web synced 2025-01-30 22:17:22 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Pipeline DAG: bottom-up design instead of top-down (#86)

Browse Source 
* bottom-up design instead of top-down

* use maxInArray
This commit is contained in:
Michael Pilosov 2024-07-04 11:05:20 -06:00 committed by GitHub
parent 93851b7a96
commit c210ef55d0
No known key found for this signature in database
GPG Key ID: B5690EEEBB952194
1 changed files with 41 additions and 26 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

67
src/app/webapp-common/shared/services/dag-manager-unsorted.service.ts
View File

@ -1,5 +1,6 @@
import { Injectable } from '@angular/core';
import {DagManagerService, DagModelItem} from '@ngneat/dag';
import { DagManagerService, DagModelItem } from '@ngneat/dag';
import { maxInArray } from '@common/shared/utils/helpers.util';
@Injectable({
providedIn: 'root'
@ -7,35 +8,49 @@ import {DagManagerService, DagModelItem} from '@ngneat/dag';
export class DagManagerUnsortedService<T extends DagModelItem> extends DagManagerService<T> {
override convertArrayToDagModel(itemsArray: Array<T>): Array<Array<T>> {
const result = [];
const levels = {};
const result: Array<Array<T>> = [];
const nodeLevels = new Map<number, number>();
const nodeChildren = new Map<number, number[]>();
const modify = (data, pid = 0, level = 0) =>
data
.filter(({ parentIds, stepId }) => {
if (levels[level] && levels[level].includes(stepId)) {
return false;
}
return parentIds.includes(pid);
})
.forEach((e) => {
if (!levels[level]) {
levels[level] = [];
}
levels[level].push(e.stepId);
// Initialize nodeChildren
itemsArray.forEach(item => {
item.parentIds.forEach(pid => {
if (!nodeChildren.has(pid)) {
nodeChildren.set(pid, []);
}
nodeChildren.get(pid).push(item.stepId);
});
});
if (this.findInDoubleArray(e.stepId, result) === -1) {
if (!result[level]) {
result[level] = [e];
} else {
result[level].push(e);
}
}
modify(data, e.stepId, level + 1);
// Function to assign levels
const assignLevels = (item, currentLevel) => {
const existingLevel = nodeLevels.get(item.stepId);
if (existingLevel === undefined || existingLevel < currentLevel) {
nodeLevels.set(item.stepId, currentLevel);
const parents = itemsArray.filter(i => item.parentIds.includes(i.stepId));
parents.forEach(parent => {
assignLevels(parent, currentLevel + 1);
});
}
};
// Start from leaf nodes and work upwards
itemsArray.forEach(item => {
if (!nodeChildren.has(item.stepId)) {
assignLevels(item, 0);
}
});
// Sort nodes by level and position them
const maxLevel = maxInArray(Array.from(nodeLevels.values()));
itemsArray.forEach(item => {
const level = maxLevel - nodeLevels.get(item.stepId);
if (!result[level]) {
result[level] = [];
}
result[level].push(item);
});
modify(itemsArray);
return result;
}
}