mirror of
https://github.moeyy.xyz/https://github.com/trekhleb/javascript-algorithms.git
synced 2024-12-25 22:46:20 +08:00
Make it possible to delete all vertex edges at once.
This commit is contained in:
parent
4a6bc1e733
commit
ff8f9c49df
@ -119,6 +119,15 @@ export default class GraphVertex {
|
||||
return this.value;
|
||||
}
|
||||
|
||||
/**
|
||||
* @return {GraphVertex}
|
||||
*/
|
||||
deleteAllEdges() {
|
||||
this.getEdges().forEach(edge => this.deleteEdge(edge));
|
||||
|
||||
return this;
|
||||
}
|
||||
|
||||
/**
|
||||
* @param {function} [callback]
|
||||
* @returns {string}
|
||||
|
@ -70,6 +70,36 @@ describe('GraphVertex', () => {
|
||||
expect(vertexA.getEdges().length).toBe(0);
|
||||
});
|
||||
|
||||
it('should delete all edges from vertex', () => {
|
||||
const vertexA = new GraphVertex('A');
|
||||
const vertexB = new GraphVertex('B');
|
||||
const vertexC = new GraphVertex('C');
|
||||
|
||||
const edgeAB = new GraphEdge(vertexA, vertexB);
|
||||
const edgeAC = new GraphEdge(vertexA, vertexC);
|
||||
vertexA
|
||||
.addEdge(edgeAB)
|
||||
.addEdge(edgeAC);
|
||||
|
||||
expect(vertexA.hasEdge(edgeAB)).toBeTruthy();
|
||||
expect(vertexB.hasEdge(edgeAB)).toBeFalsy();
|
||||
|
||||
expect(vertexA.hasEdge(edgeAC)).toBeTruthy();
|
||||
expect(vertexC.hasEdge(edgeAC)).toBeFalsy();
|
||||
|
||||
expect(vertexA.getEdges().length).toBe(2);
|
||||
|
||||
vertexA.deleteAllEdges();
|
||||
|
||||
expect(vertexA.hasEdge(edgeAB)).toBeFalsy();
|
||||
expect(vertexB.hasEdge(edgeAB)).toBeFalsy();
|
||||
|
||||
expect(vertexA.hasEdge(edgeAC)).toBeFalsy();
|
||||
expect(vertexC.hasEdge(edgeAC)).toBeFalsy();
|
||||
|
||||
expect(vertexA.getEdges().length).toBe(0);
|
||||
});
|
||||
|
||||
it('should return vertex neighbors in case if current node is start one', () => {
|
||||
const vertexA = new GraphVertex('A');
|
||||
const vertexB = new GraphVertex('B');
|
||||
|
Loading…
Reference in New Issue
Block a user