zcy
/
maxGraph
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

test: improve HierarchicalLayout tests (#245) 

Also check that the layout change the position of the cells.
development
Thomas Bouffard 2023-10-10 06:21:22 +02:00 committed by GitHub
parent 3758ac4dce
commit 54c82230c1
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 57 additions and 29 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

86
packages/core/__tests__/view/layout/HierarchicalLayout.test.ts
View File

@ -14,7 +14,7 @@ See the License for the specific language governing permissions and
limitations under the License.
*/
import { describe, test } from '@jest/globals';
import { describe, expect, test } from '@jest/globals';
import { Graph, HierarchicalLayout } from '../../../src';
function createGraph(): Graph {
@ -33,27 +33,41 @@ describe('layout execute', () => {
graph.batchUpdate(() => {
const v1 = graph.insertVertex(parent, null, '1', 0, 0, 80, 30);
const v2 = graph.insertVertex(parent, null, '2', 0, 0, 80, 30);
const v3 = graph.insertVertex(parent, null, '3', 0, 0, 80, 30);
const v3 = graph.insertVertex(parent, 'v3', '3', 0, 0, 80, 30);
const v4 = graph.insertVertex(parent, null, '4', 0, 0, 80, 30);
const v5 = graph.insertVertex(parent, null, '5', 0, 0, 80, 30);
const v6 = graph.insertVertex(parent, null, '6', 0, 0, 80, 30);
const v7 = graph.insertVertex(parent, null, '7', 0, 0, 80, 30);
const v7 = graph.insertVertex(parent, 'v7', '7', 0, 0, 80, 30);
const v8 = graph.insertVertex(parent, null, '8', 0, 0, 80, 30);
const v9 = graph.insertVertex(parent, null, '9', 0, 0, 80, 30);
const v9 = graph.insertVertex(parent, 'v9', '9', 0, 0, 80, 30);
const e1 = graph.insertEdge(parent, null, '', v1, v2);
const e2 = graph.insertEdge(parent, null, '', v2, v3);
const e3 = graph.insertEdge(parent, null, '', v3, v4);
const e4 = graph.insertEdge(parent, null, '', v4, v5);
const e5 = graph.insertEdge(parent, null, '', v5, v3);
const e6 = graph.insertEdge(parent, null, '', v5, v6);
const e7 = graph.insertEdge(parent, null, '', v6, v7);
const e8 = graph.insertEdge(parent, null, '', v7, v8);
const e9 = graph.insertEdge(parent, null, '', v8, v9);
graph.insertEdge(parent, null, '', v1, v2);
graph.insertEdge(parent, null, '', v2, v3);
graph.insertEdge(parent, null, '', v3, v4);
graph.insertEdge(parent, null, '', v4, v5);
graph.insertEdge(parent, null, '', v5, v3); // this introduces the circular path
graph.insertEdge(parent, null, '', v5, v6);
graph.insertEdge(parent, null, '', v6, v7);
graph.insertEdge(parent, null, '', v7, v8);
graph.insertEdge(parent, null, '', v8, v9);
// Execute the layout
layout.execute(parent);
});
// Verify that the position of cells changed when applying the layout
const vertex3 = graph.model.getCell('v3');
// geometry "_x": 33.51851851851852, "_y": 260
expect(vertex3?.geometry?.x).toBeCloseTo(33.518);
expect(vertex3?.geometry?.y).toBe(260);
const vertex7 = graph.model.getCell('v7');
// geometry "_x": 23.657407407407412, "_y": 780
expect(vertex7?.geometry?.x).toBeCloseTo(23.657);
expect(vertex7?.geometry?.y).toBe(780);
const vertex9 = graph.model.getCell('v9');
// geometry "_x": 22.002314814814824, "_y": 1040
expect(vertex9?.geometry?.x).toBeCloseTo(22);
expect(vertex9?.geometry?.y).toBe(1040);
});
test('Non-circular layout graph is created successfully', () => {
@ -64,32 +78,46 @@ describe('layout execute', () => {
// execute test - graph is based on HierarchicalLayout.stories.js
graph.batchUpdate(() => {
const v1 = graph.insertVertex(parent, null, '1', 0, 0, 80, 30);
const v1 = graph.insertVertex(parent, 'v1', '1', 0, 0, 80, 30);
const v2 = graph.insertVertex(parent, null, '2', 0, 0, 80, 30);
const v3 = graph.insertVertex(parent, null, '3', 0, 0, 80, 30);
const v4 = graph.insertVertex(parent, null, '4', 0, 0, 80, 30);
const v5 = graph.insertVertex(parent, null, '5', 0, 0, 80, 30);
const v6 = graph.insertVertex(parent, null, '6', 0, 0, 80, 30);
const v6 = graph.insertVertex(parent, 'v6', '6', 0, 0, 80, 30);
const v7 = graph.insertVertex(parent, null, '7', 0, 0, 80, 30);
const v8 = graph.insertVertex(parent, null, '8', 0, 0, 80, 30);
const v8 = graph.insertVertex(parent, 'v8', '8', 0, 0, 80, 30);
const v9 = graph.insertVertex(parent, null, '9', 0, 0, 80, 30);
const e1 = graph.insertEdge(parent, null, '', v1, v2);
const e2 = graph.insertEdge(parent, null, '', v1, v3);
const e3 = graph.insertEdge(parent, null, '', v3, v4);
const e4 = graph.insertEdge(parent, null, '', v2, v5);
const e5 = graph.insertEdge(parent, null, '', v1, v6);
const e6 = graph.insertEdge(parent, null, '', v2, v3);
const e7 = graph.insertEdge(parent, null, '', v6, v4);
const e8 = graph.insertEdge(parent, null, '', v6, v1);
const e9 = graph.insertEdge(parent, null, '', v6, v7);
const e10 = graph.insertEdge(parent, null, '', v7, v8);
const e11 = graph.insertEdge(parent, null, '', v7, v9);
const e12 = graph.insertEdge(parent, null, '', v7, v6);
const e13 = graph.insertEdge(parent, null, '', v7, v5);
graph.insertEdge(parent, null, '', v1, v2);
graph.insertEdge(parent, null, '', v1, v3);
graph.insertEdge(parent, null, '', v3, v4);
graph.insertEdge(parent, null, '', v2, v5);
graph.insertEdge(parent, null, '', v1, v6);
graph.insertEdge(parent, null, '', v2, v3);
graph.insertEdge(parent, null, '', v6, v4);
graph.insertEdge(parent, null, '', v6, v1);
graph.insertEdge(parent, null, '', v6, v7);
graph.insertEdge(parent, null, '', v7, v8);
graph.insertEdge(parent, null, '', v7, v9);
graph.insertEdge(parent, null, '', v7, v6);
graph.insertEdge(parent, null, '', v7, v5);
// Execute the layout
layout.execute(parent);
});
// Verify that the position of cells changed when applying the layout
const vertex1 = graph.model.getCell('v1');
// geometry "_x": 125, "_y": 260
expect(vertex1?.geometry?.x).toBe(125);
expect(vertex1?.geometry?.y).toBe(260);
const vertex6 = graph.model.getCell('v6');
// geometry "_x": 220, "_y": 130
expect(vertex6?.geometry?.x).toBe(220);
expect(vertex6?.geometry?.y).toBe(130);
const vertex8 = graph.model.getCell('v8');
// geometry "_x": 0, "_y": 130
expect(vertex8?.geometry?.x).toBe(0);
expect(vertex8?.geometry?.y).toBe(130);
});
});