hxx/javascript-algorithms
1
0
Fork 0
mirror of https://github.moeyy.xyz/https://github.com/trekhleb/javascript-algorithms.git synced 2024-11-10 11:09:43 +08:00
Code Issues Packages Projects Releases Wiki Activity

Add test for graph reverse with cycle of length two

Browse Source
This commit is contained in:
AmirMohammad Hosseini Nasab 2022-07-30 15:09:42 +04:30 committed by Amir Hosseini
parent 2c67b48c21
commit f8a84c278b
1 changed files with 29 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

29
src/data-structures/graph/__test__/Graph.test.js
View File

@ -305,6 +305,35 @@ describe('Graph', () => {
expect(graph.getNeighbors(vertexD)[0].getKey()).toBe(vertexC.getKey());
});
it('should be possible to reverse directed graph with cycle of lenght two', () => {
const vertexA = new GraphVertex('A');
const vertexB = new GraphVertex('B');
const edgeAB = new GraphEdge(vertexA, vertexB);
const edgeBA = new GraphEdge(vertexB, vertexA);
const graph = new Graph(true);
graph
.addEdge(edgeAB)
.addEdge(edgeBA);
expect(graph.toString()).toBe('A,B');
expect(graph.getAllEdges().length).toBe(2);
expect(graph.getNeighbors(vertexA).length).toBe(1);
expect(graph.getNeighbors(vertexA)[0].getKey()).toBe(vertexB.getKey());
expect(graph.getNeighbors(vertexB).length).toBe(1);
expect(graph.getNeighbors(vertexB)[0].getKey()).toBe(vertexA.getKey());
graph.reverse();
expect(graph.toString()).toBe('A,B');
expect(graph.getAllEdges().length).toBe(2);
expect(graph.getNeighbors(vertexA).length).toBe(1);
expect(graph.getNeighbors(vertexA)[0].getKey()).toBe(vertexB.getKey());
expect(graph.getNeighbors(vertexB).length).toBe(1);
expect(graph.getNeighbors(vertexB)[0].getKey()).toBe(vertexA.getKey());
});
it('should return vertices indices', () => {
const vertexA = new GraphVertex('A');
const vertexB = new GraphVertex('B');