From 25b20e1966d7ed26ee3b479e19745ea456b210e7 Mon Sep 17 00:00:00 2001
From: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
Date: Tue, 19 Apr 2022 18:21:54 +0000
Subject: [PATCH 1/2] Auto-update DIRECTORY.md

---
 DIRECTORY.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/DIRECTORY.md b/DIRECTORY.md
index 8613c684c8..c9b08760af 100644
--- a/DIRECTORY.md
+++ b/DIRECTORY.md
@@ -77,7 +77,7 @@
     * [CycleDetection](https://github.com/TheAlgorithms/Javascript/blob/master/Data-Structures/Linked-List/CycleDetection.js)
     * [DoublyLinkedList](https://github.com/TheAlgorithms/Javascript/blob/master/Data-Structures/Linked-List/DoublyLinkedList.js)
     * [RotateListRight](https://github.com/TheAlgorithms/Javascript/blob/master/Data-Structures/Linked-List/RotateListRight.js)
-    * [SingleCircularLinkedList](https://github.com/TheAlgorithms/Javascript/blob/master/Data-Structures/Linked-List/SingleCircularLinkedList.js.js)
+    * [SinglyCircularLinkedList](https://github.com/TheAlgorithms/Javascript/blob/master/Data-Structures/Linked-List/SinglyCircularLinkedList.js)
     * [SinglyLinkedList](https://github.com/TheAlgorithms/Javascript/blob/master/Data-Structures/Linked-List/SinglyLinkedList.js)
   * Queue
     * [CircularQueue](https://github.com/TheAlgorithms/Javascript/blob/master/Data-Structures/Queue/CircularQueue.js)

From 21ba488778751059df993de94ee741201875f51b Mon Sep 17 00:00:00 2001
From: CarlosZoft <carlosk2gunn@hotmail.com>
Date: Wed, 20 Apr 2022 16:42:38 -0300
Subject: [PATCH 2/2] fix: some redundancy according to standard javascript
 library

---
 Data-Structures/Tree/Trie.js          | 2 +-
 Maths/test/EulerMethod.manual-test.js | 2 +-
 Sorts/TopologicalSort.js              | 2 +-
 3 files changed, 3 insertions(+), 3 deletions(-)

diff --git a/Data-Structures/Tree/Trie.js b/Data-Structures/Tree/Trie.js
index a1d34d0631..04603f63bc 100644
--- a/Data-Structures/Tree/Trie.js
+++ b/Data-Structures/Tree/Trie.js
@@ -18,7 +18,7 @@ function Trie () {
 Trie.findAllWords = function (root, word, output) {
   if (root === null) return
   if (root.count > 0) {
-    if (typeof output === 'object') { output.push({ word: word, count: root.count }) }
+    if (typeof output === 'object') { output.push({ word, count: root.count }) }
   }
   let key
   for (key in root.children) {
diff --git a/Maths/test/EulerMethod.manual-test.js b/Maths/test/EulerMethod.manual-test.js
index 8dd5b375b6..49d6abe34d 100644
--- a/Maths/test/EulerMethod.manual-test.js
+++ b/Maths/test/EulerMethod.manual-test.js
@@ -18,7 +18,7 @@ function plotLine (label, points, width, height) {
     type: 'scatter',
     data: {
       datasets: [{
-        label: label,
+        label,
         data: points,
         showLine: true,
         fill: false,
diff --git a/Sorts/TopologicalSort.js b/Sorts/TopologicalSort.js
index 7bbc032c44..5890449533 100644
--- a/Sorts/TopologicalSort.js
+++ b/Sorts/TopologicalSort.js
@@ -42,7 +42,7 @@ export function TopologicalSorter () {
     }
 
     finishingTimeList.push({
-      node: node,
+      node,
       finishTime: ++finishTimeCount
     })
   }