refactor: remove redundant comments in Bellman-Ford search implementation

Author: monkey0722

…orithms/dp/coinChange/coinChange.test.ts …rithms/dp/coin-change/coinChange.test.tsalgorithms/dp/coinChange/coinChange.test.ts renamed to algorithms/dp/coin-change/coinChange.test.ts algorithms/dp/coinChange/coinChange.test.ts renamed to algorithms/dp/coin-change/coinChange.test.ts

@@ -16,10 +16,8 @@ export class BellmanFord {
    * @throws {Error} If the input parameters are invalid.
    */
   static findShortestPaths(vertices: number, edges: Edge[], source: number): number[] | null {
-    // Validate input
     this.validateInput(vertices, edges, source);
 
-    // Initialize distances
     const distances = new Array(vertices).fill(Infinity);
     distances[source] = 0;