Skip to content

performance_computeShortestPaths_ai_Dijkstra #578

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Draft
wants to merge 4 commits into
base: aeg/performance_computeShortestPaths
Choose a base branch
from
Draft

performance_computeShortestPaths_ai_Dijkstra #578

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
4 commits
Select commit Hold shift + click to select a range
898b3c2
Performance
aiAdrian Oct 20, 2025
41142d2
Performance
aiAdrian Oct 20, 2025
be6ef1a
lint error fixed
aiAdrian Oct 20, 2025
c4ea698
out-of-memory issue resovled for very big netzgrafik.
aiAdrian Oct 20, 2025
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
36 changes: 31 additions & 5 deletions src/app/services/analytics/origin-destination/components/origin-destination.component.ts
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -63,8 +63,36 @@ export class OriginDestinationComponent implements OnInit, OnDestroy {
private xScale: d3.ScaleBand<string>;
private yScale: d3.ScaleBand<string>;

private extractNumericODValues(odList: OriginDestination[], field: FieldName): number[] {
return odList.filter((od) => od["found"]).map((od) => od[field]);
private extractNumericODValues(odList: OriginDestination[], field: FieldName): any {
let minValue = undefined;
let maxValue = undefined;
odList
.filter((od) => od["found"])
.map((od) => {
const v = od[field];
if (minValue !== undefined) {
if (v < minValue) {
minValue = v;
} else {
if (v > maxValue) {
maxValue = v;
}
}
} else {
minValue = v;
maxValue = minValue;
}
});
if (minValue === undefined) {
return {
minValue: 0,
maxValue: 1,
};
}
return {
minValue: minValue,
maxValue: maxValue,
};
}

ngOnInit(): void {
Expand Down Expand Up @@ -236,9 +264,7 @@ export class OriginDestinationComponent implements OnInit, OnDestroy {

// compute color scale
const numericValues = this.extractNumericODValues(this.matrixData, this.colorBy);
const maxValue = numericValues.length ? Math.max(...numericValues) : 1;
const minValue = numericValues.length ? Math.min(...numericValues) : 0;
this.colorScale = this.getColorScale(minValue, maxValue);
this.colorScale = this.getColorScale(numericValues.minValue, numericValues.maxValue);

// Prepare nodeNameMap and tooltip
const nodeNameMap = new Map(this.nodeNames.map((n) => [n.shortName, n.fullName]));
Expand Down
9 changes: 7 additions & 2 deletions src/app/services/analytics/origin-destination/components/origin-destination.service.ts
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -5,6 +5,7 @@ import {DataService} from "../../../data/data.service";
import {TrainrunService} from "../../../data/trainrun.service";
import {
buildEdges,
clearComputeShortestPathsCache,
computeNeighbors,
computeShortestPaths,
topoSort,
Expand Down Expand Up @@ -78,12 +79,14 @@ export class OriginDestinationService {
);
// Perf.Opt.: this map is used to cache the keys and thus the JSON.stringify will not be called for each key request
const cachedKey = new Map<Vertex, string>();
clearComputeShortestPathsCache();

const neighbors = computeNeighbors(edges, cachedKey);
const vertices = topoSort(neighbors, cachedKey);
// In theory we could parallelize the pathfindings, but the overhead might be too big.
const res = new Map<string, [number, number]>();
odNodes.forEach((origin) => {
odNodes.forEach((origin, idx) => {
console.log("computeShortestPaths", idx, odNodes.length);
computeShortestPaths(origin.getId(), neighbors, vertices, tsSuccessor, cachedKey).forEach(
(value, key) => {
res.set([origin.getId(), key].join(","), value);
Expand All @@ -93,7 +96,9 @@ export class OriginDestinationService {

const rows = [];
odNodes.sort((a, b) => a.getBetriebspunktName().localeCompare(b.getBetriebspunktName()));
odNodes.forEach((origin) => {
odNodes.forEach((origin, idx) => {
console.log("compute o/d pairs", idx, odNodes.length);

odNodes.forEach((destination) => {
if (origin.getId() === destination.getId()) {
return;
Expand Down
Loading