algorithm/javascript-algorithms
1
0
Fork 0
mirror of https://github.com/trekhleb/javascript-algorithms.git synced 2026-03-13 08:51:02 +08:00
Code Issues Packages Projects Releases Wiki Activity

Upgrade dependencies and fix ESLint issues.

Browse Source
This commit is contained in:
Oleksii Trekhleb
2020-07-26 13:06:15 +02:00
parent 4d8baf87db
commit 63f5a27152
36 changed files with 4442 additions and 1630 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
src/data-structures/graph/GraphVertex.js
View File

@@ -64,7 +64,7 @@ export default class GraphVertex {
* @return {GraphEdge[]}
*/
getEdges() {
return this.edges.toArray().map(linkedListNode => linkedListNode.value);
return this.edges.toArray().map((linkedListNode) => linkedListNode.value);
}
/**
@@ -80,7 +80,7 @@ export default class GraphVertex {
*/
hasEdge(requiredEdge) {
const edgeNode = this.edges.find({
callback: edge => edge === requiredEdge,
callback: (edge) => edge === requiredEdge,
});
return !!edgeNode;
@@ -92,7 +92,7 @@ export default class GraphVertex {
*/
hasNeighbor(vertex) {
const vertexNode = this.edges.find({
callback: edge => edge.startVertex === vertex || edge.endVertex === vertex,
callback: (edge) => edge.startVertex === vertex || edge.endVertex === vertex,
});
return !!vertexNode;
@@ -123,7 +123,7 @@ export default class GraphVertex {
* @return {GraphVertex}
*/
deleteAllEdges() {
this.getEdges().forEach(edge => this.deleteEdge(edge));
this.getEdges().forEach((edge) => this.deleteEdge(edge));
return this;
}