fix: broken Java links (#164)

TheAlgorithms · Aug 11, 2022 · 47287df · 47287df
1 parent 7c453db
commit 47287df
Show file tree

Hide file tree

Showing 47 changed files with 50 additions and 50 deletions.
diff --git a/en/Data Structures/Graph/Bellman-Ford.md b/en/Data Structures/Graph/Bellman-Ford.md
@@ -90,7 +90,7 @@ O(V^2)
 
 #### Code Implementation Links
 
-- [Java](https://github.com/TheAlgorithms/Java/blob/master/DataStructures/Graphs/BellmanFord.java)
+- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/datastructures/graphs/BellmanFord.java)
 - [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/dynamic_programming/bellman_ford.cpp)
 - [Python](https://github.com/TheAlgorithms/Python/blob/master/graphs/bellman_ford.py)
 - [C](https://github.com/TheAlgorithms/C/blob/master/data_structures/graphs/bellman_ford.c)

diff --git a/en/Data Structures/Linked Lists/Doubly Linked List.md b/en/Data Structures/Linked Lists/Doubly Linked List.md
@@ -102,7 +102,7 @@ class LinkedList {
 
 ## Code Implementation Links
 
-- [Java](https://github.com/TheAlgorithms/Java/blob/master/DataStructures/Lists/DoublyLinkedList.java)
+- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/datastructures/lists/DoublyLinkedList.java)
 - [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/Data%20Structure/Doubly%20Linked%20List.cpp)
 - [Python](https://github.com/TheAlgorithms/Python/blob/master/data_structures/linked_list/doubly_linked_list.py)
 - [Go](https://github.com/TheAlgorithms/Go/blob/master/data-structures/linked-list/double-linkedlist.go)

diff --git a/en/Data Structures/Linked Lists/Singly Linked List.md b/en/Data Structures/Linked Lists/Singly Linked List.md
@@ -39,7 +39,7 @@ class LinkedList {
 
 ## Code Implementation Links
 
-- [Java](https://github.com/TheAlgorithms/Java/blob/master/DataStructures/Lists/SinglyLinkedList.java)
+- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/datastructures/lists/SinglyLinkedList.java)
 - [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/Data%20Structure/Linked%20List.cpp)
 - [Python](https://github.com/TheAlgorithms/Python/blob/master/data_structures/linked_list/singly_linked_list.py)
 - [Ruby](https://github.com/TheAlgorithms/Ruby/blob/master/data_structures/linked_lists/single_list.rb)

diff --git a/en/Dynamic Programming/Longest Common Subsequence.md b/en/Dynamic Programming/Longest Common Subsequence.md
@@ -71,7 +71,7 @@ So the length of LCS is `dp[4][4] = 3`.
 
 #### Code Implementation Links
 
-- [Java](https://github.com/TheAlgorithms/Java/blob/master/Dynamic%20Programming/LongestCommonSubsequence.java)
+- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/dynamicprogramming/LongestCommonSubsequence.java)
 - [Python](https://github.com/TheAlgorithms/Python/blob/master/dynamic_programming/longest_common_subsequence.py)
 - [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/Dynamic%20Programming/Longest%20Common%20Subsequence.cpp)
 

diff --git a/en/Search Algorithms/Binary Search.md b/en/Search Algorithms/Binary Search.md
@@ -40,7 +40,7 @@ A simple Binary Search implementation may return -1 as 9 is not present in the a
 
 #### Code Implementation Links
 
-- [Java](https://github.com/TheAlgorithms/Java/blob/master/Searches/BinarySearch.java)
+- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/searches/BinarySearch.java)
 - [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/Search/Binary%20Search.cpp)
 - [Python](https://github.com/TheAlgorithms/Python/blob/master/searches/binary_search.py)
 - [C-Sharp](https://github.com/TheAlgorithms/C-Sharp/blob/master/searches/binary_search.cs)

diff --git a/en/Search Algorithms/Linear Search.md b/en/Search Algorithms/Linear Search.md
@@ -35,7 +35,7 @@ Linear Search should return -1 as 6 is not present in the array
 
 #### Code Implementation Links
 
-- [Java](https://github.com/TheAlgorithms/Java/blob/master/Searches/LinearSearch.java)
+- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/searches/LinearSearch.java)
 - [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/Search/Linear%20Search.cpp)
 - [Python](https://github.com/TheAlgorithms/Python/blob/master/searches/linear_search.py)
 

diff --git a/en/Sorting Algorithms/Bubble Sort.md b/en/Sorting Algorithms/Bubble Sort.md
@@ -81,7 +81,7 @@ Since there are no swaps in above steps, it means the array is sorted and we can
 
 #### Code Implementation Links
 
-- [Java](https://github.com/TheAlgorithms/Java/blob/master/Sorts/BubbleSort.java)
+- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/sorts/BubbleSort.java)
 - [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/sorting/bubble_sort.cpp)
 - [Python](https://github.com/TheAlgorithms/Python/blob/master/sorts/bubble_sort.py)
 - [C-Sharp](https://github.com/TheAlgorithms/C-Sharp/blob/master/Algorithms/Sorters/Comparison/BubbleSorter.cs)

diff --git a/en/Sorting Algorithms/Heap Sort.md b/en/Sorting Algorithms/Heap Sort.md
@@ -57,7 +57,7 @@ in top down manner.
 
 #### Code Implementation Links
 
-- [Java](https://github.com/TheAlgorithms/Java/blob/master/Sorts/HeapSort.java)
+- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/sorts/HeapSort.java)
 - [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/sorting/heap_sort.cpp)
 - [Python](https://github.com/TheAlgorithms/Python/blob/master/sorts/heap_sort.py)
 - [Go](https://github.com/TheAlgorithms/Go/blob/master/sorts/heapsort.go)

diff --git a/en/Sorting Algorithms/Insertion Sort.md b/en/Sorting Algorithms/Insertion Sort.md
@@ -50,7 +50,7 @@ and elements from 11 to 13 will move one position ahead of their current positio
 
 #### Code Implementation Links
 
-- [Java](https://github.com/TheAlgorithms/Java/blob/master/Sorts/InsertionSort.java)
+- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/sorts/InsertionSort.java)
 - [C](https://github.com/TheAlgorithms/C/blob/master/sorting/insertion_sort.c)
 - [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/sorting/insertion_sort.cpp)
 - [C#](https://github.com/TheAlgorithms/C-Sharp/blob/master/Algorithms/Sorters/Comparison/InsertionSorter.cs)

diff --git a/en/Sorting Algorithms/Merge Sort.md b/en/Sorting Algorithms/Merge Sort.md
@@ -61,7 +61,7 @@ At the next stack level [1, 2, 5, 9] and [3, 4, 6, 7] will be merged and we will
 
 #### Code Implementation Links
 
-- [Java](https://github.com/TheAlgorithms/Java/blob/master/Sorts/MergeSort.java)
+- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/sorts/MergeSort.java)
 - [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/sorting/merge_sort.cpp)
 - [Python](https://github.com/TheAlgorithms/Python/blob/master/sorts/merge_sort.py)
 - [C-Sharp](https://github.com/TheAlgorithms/C-Sharp/blob/master/Algorithms/Sorters/Comparison/MergeSorter.cs)

diff --git a/en/Sorting Algorithms/Quick Sort.md b/en/Sorting Algorithms/Quick Sort.md
@@ -68,7 +68,7 @@ it.
 
 #### Code Implementation Links
 
-- [Java](https://github.com/TheAlgorithms/Java/blob/master/Sorts/QuickSort.java)
+- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/sorts/QuickSort.java)
 - [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/Sorting/Quick%20Sort.cpp)
 - [Python](https://github.com/TheAlgorithms/Python/blob/master/sorts/quick_sort.py)
 - [Ruby](https://github.com/TheAlgorithms/Ruby/blob/master/sorting/quicksort.rb)

diff --git a/en/Sorting Algorithms/Recursive Versions/Recursive Bubble Sort.md b/en/Sorting Algorithms/Recursive Versions/Recursive Bubble Sort.md
@@ -65,7 +65,7 @@ void bubbleSort(arr[], n)
 
 ## Implementations
 
-- [Java](https://github.com/TheAlgorithms/Java/blob/master/Sorts/BubbleSortRecursion.java)
+- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/sorts/BubbleSortRecursion.java)
 - [C](https://github.com/TheAlgorithms/C/blob/master/sorting/bubble_sort_recursion.c)
 
 ## Video Explanation

diff --git a/en/Sorting Algorithms/Selection Sort.md b/en/Sorting Algorithms/Selection Sort.md
@@ -51,7 +51,7 @@ The array is now sorted.
 
 #### Code Implementation Links
 
-- [Java](https://github.com/TheAlgorithms/Java/blob/master/Sorts/SelectionSort.java)
+- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/sorts/SelectionSort.java)
 - [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/Sorting/Selection%20Sort.cpp)
 - [Python](https://github.com/TheAlgorithms/Python/blob/master/sorts/selection_sort.py)
 - [Go](https://github.com/TheAlgorithms/Go/blob/master/sorts/selection_sort.go)

diff --git a/en/Sorting Algorithms/Shell Sort.md b/en/Sorting Algorithms/Shell Sort.md
@@ -56,7 +56,7 @@ Initial Gap: 4
 
 #### Code Implementation Links
 
-- [Java](https://github.com/TheAlgorithms/Java/blob/master/Sorts/ShellSort.java)
+- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/sorts/ShellSort.java)
 - [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/Sorting/Shell%20Sort.cpp)
 - [Python](https://github.com/TheAlgorithms/Python/blob/master/sorts/shell_sort.py)
 - [C-Sharp](https://github.com/TheAlgorithms/C-Sharp/blob/master/sorts/shell_sort.cs)

diff --git a/es/Algoritmos de Ordenamiento/Ordenamiento Burbuja.md b/es/Algoritmos de Ordenamiento/Ordenamiento Burbuja.md
@@ -81,7 +81,7 @@ Como no hay intercambios en los pasos de arriba, el arreglo ya se ha ordenado y
 
 #### Enlaces a implementaciones de código
 
-- [Java](https://github.com/TheAlgorithms/Java/blob/master/Sorts/BubbleSort.java)
+- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/sorts/BubbleSort.java)
 - [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/Sorting/Bubble%20Sort.cpp)
 - [Python](https://github.com/TheAlgorithms/Python/blob/master/sorts/bubble_sort.py)
 - [C-Sharp](https://github.com/TheAlgorithms/C-Sharp/blob/master/sorts/bubble_sort.cs)

diff --git a/es/Algoritmos de Ordenamiento/Ordenamiento Shell.md b/es/Algoritmos de Ordenamiento/Ordenamiento Shell.md
@@ -57,7 +57,7 @@ Brecha inicial: 4
 
 #### Enlaces de implementación de código
 
-- [Java](https://github.com/TheAlgorithms/Java/blob/master/Sorts/ShellSort.java)
+- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/sorts/ShellSort.java)
 - [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/Sorting/Shell%20Sort.cpp)
 - [Python](https://github.com/TheAlgorithms/Python/blob/master/sorts/shell_sort.py)
 - [C-Sharp](https://github.com/TheAlgorithms/C-Sharp/blob/master/sorts/shell_sort.cs)

diff --git a/es/Algoritmos de Ordenamiento/Ordenamiento de fusión.md b/es/Algoritmos de Ordenamiento/Ordenamiento de fusión.md
@@ -33,7 +33,7 @@ Ahora combine ambas mitades para obtener la matriz ordenada [0, 1, 2, 3, 5, 9]
 
 #### Enlaces de la implementación del código
 
-- [Java](https://github.com/TheAlgorithms/Java/blob/master/Sorts/MergeSort.java)
+- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/sorts/MergeSort.java)
 - [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/sorting/merge_sort.cpp)
 - [Python](https://github.com/TheAlgorithms/Python/blob/master/sorts/merge_sort.py)
 - [C-Sharp](https://github.com/TheAlgorithms/C-Sharp/blob/master/Algorithms/Sorters/Comparison/MergeSorter.cs)

diff --git a/es/Algoritmos de Ordenamiento/Ordenamiento de inserción.md b/es/Algoritmos de Ordenamiento/Ordenamiento de inserción.md
@@ -49,7 +49,7 @@ y los elementos del 11 al 13 se moverán una posición por delante de su posici
 
 #### Enlaces de implementación del código
 
-- [Java](https://github.com/TheAlgorithms/Java/blob/master/Sorts/InsertionSort.java)
+- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/sorts/InsertionSort.java)
 - [C](https://github.com/TheAlgorithms/C/blob/master/sorting/insertion_sort.c)
 - [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/sorting/insertion_sort.cpp)
 - [C#](https://github.com/TheAlgorithms/C-Sharp/blob/master/Algorithms/Sorters/Comparison/InsertionSorter.cs)

diff --git a/es/Algoritmos de Ordenamiento/Ordenamiento de montón (heap sort).md b/es/Algoritmos de Ordenamiento/Ordenamiento de montón (heap sort).md
@@ -57,7 +57,7 @@ El procedimiento de amontonar se llama a sí mismo recursivamente para construir
 
 #### Enlaces de implementación de código
 
-- [Java](https://github.com/TheAlgorithms/Java/blob/master/Sorts/HeapSort.java)
+- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/sorts/HeapSort.java)
 - [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/sorting/heap_sort.cpp)
 - [Python](https://github.com/TheAlgorithms/Python/blob/master/sorts/heap_sort.py)
 - [Ir](https://github.com/TheAlgorithms/Go/blob/master/sorts/heapsort.go)

diff --git a/es/Algoritmos de Ordenamiento/Ordenamiento de selección.md b/es/Algoritmos de Ordenamiento/Ordenamiento de selección.md
@@ -51,7 +51,7 @@ La matriz ahora está ordenada.
 
 #### Enlaces de implementación de código
 
-- [Java](https://github.com/TheAlgorithms/Java/blob/master/Sorts/SelectionSort.java)
+- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/sorts/SelectionSort.java)
 - [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/Sorting/Selection%20Sort.cpp)
 - [Python](https://github.com/TheAlgorithms/Python/blob/master/sorts/selection_sort.py)
 - [Ir](https://github.com/TheAlgorithms/Go/blob/master/sorts/selection_sort.go)

diff --git a/es/Algoritmos de Ordenamiento/Ordenamiento rápido.md b/es/Algoritmos de Ordenamiento/Ordenamiento rápido.md
@@ -69,7 +69,7 @@ eso.
 
 #### Enlaces de implementación de código
 
-- [Java](https://github.com/TheAlgorithms/Java/blob/master/Sorts/QuickSort.java)
+- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/sorts/QuickSort.java)
 - [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/Sorting/Quick%20Sort.cpp)
 - [Python](https://github.com/TheAlgorithms/Python/blob/master/sorts/quick_sort.py)
 - [Ruby](https://github.com/TheAlgorithms/Ruby/blob/master/sorting/quicksort.rb)

diff --git a/es/Algoritmos de búsqueda/Búsqueda binaria.md b/es/Algoritmos de búsqueda/Búsqueda binaria.md
@@ -40,7 +40,7 @@ Búsqueda binaria debe devolver -1 dado que 9 no está presente en la matriz
 
 #### Enlaces de implementación de código
 
-- [Java](https://github.com/TheAlgorithms/Java/blob/master/Searches/BinarySearch.java)
+- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/searches/BinarySearch.java)
 - [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/Search/Binary%20Search.cpp)
 - [Python](https://github.com/TheAlgorithms/Python/blob/master/searches/binary_search.py)
 - [C-Sharp](https://github.com/TheAlgorithms/C-Sharp/blob/master/searches/binary_search.cs)

diff --git a/es/Algoritmos de búsqueda/Búsqueda lineal.md b/es/Algoritmos de búsqueda/Búsqueda lineal.md
@@ -35,7 +35,7 @@ La búsqueda lineal debe devolver -1 ya que 6 no está presente en la matriz
 
 #### Enlaces de implementación de código
 
-- [Java](https://github.com/TheAlgorithms/Java/blob/master/Searches/LinearSearch.java)
+- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/searches/LinearSearch.java)
 - [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/Search/Linear%20Search.cpp)
 - [Python](https://github.com/TheAlgorithms/Python/blob/master/searches/linear_search.py)
 - [JavaScript](https://github.com/TheAlgorithms/Javascript/blob/master/Search/LinearSearch.js)

diff --git a/es/Estructuras de datos/Gráfico/Bellman Ford.md b/es/Estructuras de datos/Gráfico/Bellman Ford.md
@@ -88,7 +88,7 @@ E 1 A->B->E = -1 + 2
 
 #### Enlaces de implementación de código
 
-- [Java](https://github.com/TheAlgorithms/Java/blob/master/DataStructures/Graphs/BellmanFord.java)
+- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/datastructures/graphs/BellmanFord.java)
 - [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/Dynamic%20Programming/Bellman-Ford.cpp)
 - [Python](https://github.com/TheAlgorithms/Python/blob/master/data_structures/graph/bellman_ford.py)
 - [C](https://github.com/TheAlgorithms/C/blob/master/data_structures/graphs/Bellman-Ford.c)

diff --git a/es/Estructuras de datos/Listas vinculadas/Doble lista vinculada.md b/es/Estructuras de datos/Listas vinculadas/Doble lista vinculada.md
@@ -104,7 +104,7 @@ class LinkedList {
 
 ## Enlaces de implementación de código
 
-- [Java](https://github.com/TheAlgorithms/Java/blob/master/DataStructures/Lists/DoublyLinkedList.java)
+- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/datastructures/lists/DoublyLinkedList.java)
 - [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/Data%20Structure/Doubly%20Linked%20List.cpp)
 - [Python](https://github.com/TheAlgorithms/Python/blob/master/data_structures/linked_list/doubly_linked_list.py)
 - [Go](https://github.com/TheAlgorithms/Go/blob/master/data-structures/linked-list/double-linkedlist.go)

diff --git a/es/Estructuras de datos/Listas vinculadas/Lista singular vinculada.md b/es/Estructuras de datos/Listas vinculadas/Lista singular vinculada.md
@@ -39,7 +39,7 @@ class LinkedList {
 
 ## Enlaces de implementación de código
 
-- [Java](https://github.com/TheAlgorithms/Java/blob/master/DataStructures/Lists/SinglyLinkedList.java)
+- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/datastructures/lists/SinglyLinkedList.java)
 - [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/Data%20Structure/Linked%20List.cpp)
 - [Python](https://github.com/TheAlgorithms/Python/blob/master/data_structures/linked_list/singly_linked_list.py)
 - [Ruby](https://github.com/TheAlgorithms/Ruby/blob/master/data_structures/linked_lists/single_list.rb)

diff --git a/es/Programación dinamica/Subsecuencia común más larga.md b/es/Programación dinamica/Subsecuencia común más larga.md
@@ -77,7 +77,7 @@ Así que la longitud de LCS es `dp[4] [4] = 3`.
 
 #### Enlaces de implementación de código
 
-- [Java](https://github.com/TheAlgorithms/Java/blob/master/Dynamic%20Programming/LongestCommonSubsequence.java)
+- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/dynamicprogramming/LongestCommonSubsequence.java)
 - [Python](https://github.com/TheAlgorithms/Python/blob/master/dynamic_programming/longest_common_subsequence.py)
 - [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/Dynamic%20Programming/Longest%20Common%20Subsequence.cpp)
 - [JavaScript](https://github.com/TheAlgorithms/Javascript/blob/master/Dynamic-Programming/LongestCommonSubsequence.js)

diff --git a/ko/자료구조/그래프/벨먼-포드 알고리즘.md b/ko/자료구조/그래프/벨먼-포드 알고리즘.md
@@ -96,10 +96,10 @@
 
 ## 구현
 
-- [Java](https://github.com/TheAlgorithms/Java/blob/master/DataStructures/Graphs/BellmanFord.java)
-- [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/dynamic_programming/bellman_ford.cpp)
-- [Python](https://github.com/TheAlgorithms/Python/blob/master/graphs/bellman_ford.py)
-- [C](https://github.com/TheAlgorithms/C/blob/master/data_structures/graphs/bellman_ford.c)
+- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/datastructures/graphs/BellmanFord.java)
+- [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/Dynamic%20Programming/Bellman-Ford.cpp)
+- [Python](https://github.com/TheAlgorithms/Python/blob/master/data_structures/graph/bellman_ford.py)
+- [C](https://github.com/TheAlgorithms/C/blob/master/data_structures/graphs/Bellman-Ford.c)
 
 ## 영상 URL
 

diff --git a/ko/자료구조/연결 리스트/단일 연결 리스트.md b/ko/자료구조/연결 리스트/단일 연결 리스트.md
@@ -40,7 +40,7 @@ class LinkedList {
 
 ## 구현
 
-- [Java](https://github.com/TheAlgorithms/Java/blob/master/DataStructures/Lists/SinglyLinkedList.java)
+- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/datastructures/lists/SinglyLinkedList.java)
 - [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/Data%20Structure/Linked%20List.cpp)
 - [Python](https://github.com/TheAlgorithms/Python/blob/master/data_structures/linked_list/singly_linked_list.py)
 - [Ruby](https://github.com/TheAlgorithms/Ruby/blob/master/data_structures/linked_lists/single_list.rb)

diff --git a/ko/자료구조/연결 리스트/이중 연결 리스트.md b/ko/자료구조/연결 리스트/이중 연결 리스트.md
@@ -102,7 +102,7 @@ class LinkedList {
 
 ## 구현
 
-- [Java](https://github.com/TheAlgorithms/Java/blob/master/DataStructures/Lists/DoublyLinkedList.java)
+- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/datastructures/lists/DoublyLinkedList.java)
 - [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/Data%20Structure/Doubly%20Linked%20List.cpp)
 - [Python](https://github.com/TheAlgorithms/Python/blob/master/data_structures/linked_list/doubly_linked_list.py)
 - [Go](https://github.com/TheAlgorithms/Go/blob/master/data-structures/linked-list/double-linkedlist.go)

diff --git a/ko/정렬/버블정렬.md b/ko/정렬/버블정렬.md
@@ -81,7 +81,7 @@
 
 #### 코드 구현
 
-- [자바](https://github.com/TheAlgorithms/Java/blob/master/Sorts/BubbleSort.java)
+- [자바](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/sorts/BubbleSort.java)
 - [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/sorting/bubble_sort.cpp)
 - [파이썬](https://github.com/TheAlgorithms/Python/blob/master/sorts/bubble_sort.py)
 - [C#](https://github.com/TheAlgorithms/C-Sharp/blob/master/Algorithms/Sorters/Comparison/BubbleSorter.cs)

diff --git a/ko/정렬/힙정렬.md b/ko/정렬/힙정렬.md
@@ -55,7 +55,7 @@ or O(n) (동일 키) 최선의 경우
 
 #### 코드구현
 
-- [자바](https://github.com/TheAlgorithms/Java/blob/master/Sorts/HeapSort.java)
+- [자바](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/sorts/HeapSort.java)
 - [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/sorting/heap_sort.cpp)
 - [파이썬](https://github.com/TheAlgorithms/Python/blob/master/sorts/heap_sort.py)
 - [고](https://github.com/TheAlgorithms/Go/blob/master/sorts/heapsort.go)

diff --git a/ko/탐색/선형탐색.md b/ko/탐색/선형탐색.md
@@ -35,7 +35,7 @@ O(1)
 
 #### 구현
 
-- [자바](https://github.com/TheAlgorithms/Java/blob/master/Searches/LinearSearch.java)
+- [자바](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/searches/LinearSearch.java)
 - [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/Search/Linear%20Search.cpp)
 - [파이썬](https://github.com/TheAlgorithms/Python/blob/master/searches/linear_search.py)
 

diff --git a/ko/탐색/이분탐색.md b/ko/탐색/이분탐색.md
@@ -40,7 +40,7 @@
 
 #### 구현
 
-- [자바](https://github.com/TheAlgorithms/Java/blob/master/Searches/BinarySearch.java)
+- [자바](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/searches/BinarySearch.java)
 - [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/Search/Binary%20Search.cpp)
 - [파이썬](https://github.com/TheAlgorithms/Python/blob/master/searches/binary_search.py)
 - [C#](https://github.com/TheAlgorithms/C-Sharp/blob/master/searches/binary_search.cs)