Issue Description:
I would like to contribute implementations of the Bellman-Ford algorithm in Java, along with related LeetCode problems and Cyclic Redundancy Check (CRC) code.
Proposed additions:
Bellman-Ford Algorithm (Java)
Single-source shortest path for graphs with negative weights.
Detects negative weight cycles.
Related LeetCode Problems:
LeetCode 743 – Network Delay Time
LeetCode 787 – Cheapest Flights Within K Stops
Implementation of standard CRC algorithm in java.
Benefits:
Provides reusable and well-documented Java implementations.
Helps learners understand Bellman-Ford and CRC algorithms.
Covers both standard algorithms and constrained/real-world applications.
@ghostmkg Kindly assign this to me under Hactoberfest'25 by including all related tags.
Issue Description:
I would like to contribute implementations of the Bellman-Ford algorithm in Java, along with related LeetCode problems and Cyclic Redundancy Check (CRC) code.
Proposed additions:
Bellman-Ford Algorithm (Java)
Single-source shortest path for graphs with negative weights.
Detects negative weight cycles.
Related LeetCode Problems:
LeetCode 743 – Network Delay Time
LeetCode 787 – Cheapest Flights Within K Stops
Implementation of standard CRC algorithm in java.
Benefits:
Provides reusable and well-documented Java implementations.
Helps learners understand Bellman-Ford and CRC algorithms.
Covers both standard algorithms and constrained/real-world applications.
@ghostmkg Kindly assign this to me under Hactoberfest'25 by including all related tags.