marcel/mermaid
1
0
Fork 0
mirror of https://github.com/mermaid-js/mermaid.git synced 2025-10-10 01:29:49 +02:00
Code Issues Packages Projects Releases Wiki Activity

Updated nodeOrdering test case

Browse Source
This commit is contained in:
shubham-mermaid
2025-06-10 20:50:39 +05:30
parent 1a5a846d71
commit b70abed096
1 changed files with 4 additions and 7 deletions
Download Patch File Download Diff File Expand all files Collapse all files

11
packages/mermaid/src/rendering-util/layout-algorithms/ipsepCola/nodeOrdering.spec.ts
View File

@@ -51,14 +51,11 @@ describe('nodeOrdering', () => {
layerAssignment(layoutData); layerAssignment(layoutData);
// Call Node order Assignment for the graph // Call Node order Assignment for the graph
assignNodeOrder(50, layoutData); assignNodeOrder(1, layoutData);
expect(layoutData.nodes.find((node: Node) => node.id === 'two').order).toEqual(0); expect(layoutData.nodes.find((node: Node) => node.id === 'two').order).toEqual(0);
expect(layoutData.nodes.find((node: Node) => node.id === 'b1').order).toEqual(0); expect(layoutData.nodes.find((node: Node) => node.id === 'b1').order).toEqual(0);
expect(layoutData.nodes.find((node: Node) => node.id === 'three').order).toEqual(0); expect(layoutData.nodes.find((node: Node) => node.id === 'three').order).toEqual(0);
expect(layoutData.nodes.find((node: Node) => node.id === 'c2').order).toEqual(0); expect(layoutData.nodes.find((node: Node) => node.id === 'c2').order).toEqual(0);
// expect(graph.getNodeAttributes('B').layer).toEqual(2);
// expect(graph.getNodeAttributes('C').layer).toEqual(3);
}); });
it('should correctly assign the orders to node', async () => { it('should correctly assign the orders to node', async () => {
@@ -80,7 +77,7 @@ describe('nodeOrdering', () => {
layerAssignment(layoutData); layerAssignment(layoutData);
// Call Node order Assignment for the graph // Call Node order Assignment for the graph
assignNodeOrder(50, layoutData); assignNodeOrder(1, layoutData);
expect(layoutData.nodes.find((node: Node) => node.id === 'one').order).toEqual(0.75); expect(layoutData.nodes.find((node: Node) => node.id === 'one').order).toEqual(0.75);
expect(layoutData.nodes.find((node: Node) => node.id === 'a1').order).toEqual(0); expect(layoutData.nodes.find((node: Node) => node.id === 'a1').order).toEqual(0);
expect(layoutData.nodes.find((node: Node) => node.id === 'a2').order).toEqual(1); expect(layoutData.nodes.find((node: Node) => node.id === 'a2').order).toEqual(1);
@@ -110,7 +107,7 @@ describe('nodeOrdering', () => {
layerAssignment(layoutData); layerAssignment(layoutData);
// Call Node order Assignment for the graph // Call Node order Assignment for the graph
assignNodeOrder(50, layoutData); assignNodeOrder(1, layoutData);
expect(layoutData.nodes.find((node: Node) => node.id === 'P1').order).toEqual(0); expect(layoutData.nodes.find((node: Node) => node.id === 'P1').order).toEqual(0);
expect(layoutData.nodes.find((node: Node) => node.id === 'P1.5').order).toEqual(1); expect(layoutData.nodes.find((node: Node) => node.id === 'P1.5').order).toEqual(1);
expect(layoutData.nodes.find((node: Node) => node.id === 'P2').order).toEqual(0); expect(layoutData.nodes.find((node: Node) => node.id === 'P2').order).toEqual(0);
@@ -145,7 +142,7 @@ describe('nodeOrdering', () => {
layerAssignment(layoutData); layerAssignment(layoutData);
// Call Node order Assignment for the graph // Call Node order Assignment for the graph
assignNodeOrder(50, layoutData); assignNodeOrder(1, layoutData);
expect(layoutData.nodes.find((node: Node) => node.id === 'Z').order).toEqual(8); expect(layoutData.nodes.find((node: Node) => node.id === 'Z').order).toEqual(8);
expect(layoutData.nodes.find((node: Node) => node.id === 'Y').order).toEqual(0.5); expect(layoutData.nodes.find((node: Node) => node.id === 'Y').order).toEqual(0.5);
expect(layoutData.nodes.find((node: Node) => node.id === 'X').order).toEqual(0); expect(layoutData.nodes.find((node: Node) => node.id === 'X').order).toEqual(0);