mirror of
https://github.com/trekhleb/javascript-algorithms.git
synced 2026-03-13 08:51:02 +08:00
43 lines
1.3 KiB
JavaScript
43 lines
1.3 KiB
JavaScript
import GraphEdge from '../GraphEdge';
|
|
import GraphVertex from '../GraphVertex';
|
|
|
|
describe('GraphEdge', () => {
|
|
it('should create graph edge with default weight', () => {
|
|
const startVertex = new GraphVertex('A');
|
|
const endVertex = new GraphVertex('B');
|
|
const edge = new GraphEdge(startVertex, endVertex);
|
|
|
|
expect(edge.getKey()).toBe('A_B');
|
|
expect(edge.toString()).toBe('A_B');
|
|
expect(edge.startVertex).toEqual(startVertex);
|
|
expect(edge.endVertex).toEqual(endVertex);
|
|
expect(edge.weight).toEqual(0);
|
|
});
|
|
|
|
it('should create graph edge with predefined weight', () => {
|
|
const startVertex = new GraphVertex('A');
|
|
const endVertex = new GraphVertex('B');
|
|
const edge = new GraphEdge(startVertex, endVertex, 10);
|
|
|
|
expect(edge.startVertex).toEqual(startVertex);
|
|
expect(edge.endVertex).toEqual(endVertex);
|
|
expect(edge.weight).toEqual(10);
|
|
});
|
|
|
|
it('should be possible to do edge reverse', () => {
|
|
const vertexA = new GraphVertex('A');
|
|
const vertexB = new GraphVertex('B');
|
|
const edge = new GraphEdge(vertexA, vertexB, 10);
|
|
|
|
expect(edge.startVertex).toEqual(vertexA);
|
|
expect(edge.endVertex).toEqual(vertexB);
|
|
expect(edge.weight).toEqual(10);
|
|
|
|
edge.reverse();
|
|
|
|
expect(edge.startVertex).toEqual(vertexB);
|
|
expect(edge.endVertex).toEqual(vertexA);
|
|
expect(edge.weight).toEqual(10);
|
|
});
|
|
});
|