|
| 1 | +import { Graph } from '../Graph2' |
| 2 | + |
| 3 | +describe('Test Graph2', () => { |
| 4 | + const vertices = ['A', 'B', 'C', 'D', 'E', 'F'] |
| 5 | + const graph = new Graph(vertices.length) |
| 6 | + |
| 7 | + // adding vertices |
| 8 | + for (let i = 0; i < vertices.length; i++) { |
| 9 | + graph.addVertex(vertices[i]) |
| 10 | + } |
| 11 | + |
| 12 | + // adding edges |
| 13 | + graph.addEdge('A', 'B') |
| 14 | + graph.addEdge('A', 'D') |
| 15 | + graph.addEdge('A', 'E') |
| 16 | + graph.addEdge('B', 'C') |
| 17 | + graph.addEdge('D', 'E') |
| 18 | + graph.addEdge('E', 'F') |
| 19 | + graph.addEdge('E', 'C') |
| 20 | + graph.addEdge('C', 'F') |
| 21 | + |
| 22 | + it('Check adjacency lists', () => { |
| 23 | + const mockFn = jest.fn() |
| 24 | + graph.printGraph(mockFn) |
| 25 | + |
| 26 | + // Expect one call per vertex |
| 27 | + expect(mockFn.mock.calls.length).toBe(vertices.length) |
| 28 | + |
| 29 | + // Collect adjacency lists from output (call args) |
| 30 | + const adjListArr = mockFn.mock.calls.map(v => v[0]) |
| 31 | + |
| 32 | + expect(adjListArr).toEqual([ |
| 33 | + 'A -> B D E ', |
| 34 | + 'B -> A C ', |
| 35 | + 'C -> B E F ', |
| 36 | + 'D -> A E ', |
| 37 | + 'E -> A D F C ', |
| 38 | + 'F -> E C ' |
| 39 | + ]) |
| 40 | + }) |
| 41 | +}) |
0 commit comments