Algorithms

Algorithms copied to clipboard

In the current implementation, the noot node is always marked as an articulation point but this is not correct. To determine if the root node is an articulation point, an...

mt-akar

hoducdat

#302 Improve TSP test suite

1

Added 5 new test cases, functionally changed 2 others and refactored the rest to improve readability (e.g. not defining a 3x3 matrix with values when the test only aims to...

Aleks-Petkov

Add triangle centroid finding algorithm

1


williamfiset

## Brief I have refactored the code for selected Algorithms and Data Structures to improve structure, readability, reusability and remove duplicate code from some classes while preserving their behaviour. ##...

AdilOtha

Add Rope data structure implementation

1

I think adding a [Rope](https://en.wikipedia.org/wiki/Rope_(data_structure)) implementation to the [datastructures](https://github.com/williamfiset/Algorithms/tree/master/src/main/java/com/williamfiset/algorithms/datastructures) section would be useful.

alirezaghey

Implement Borůvka's MST algorithm

1

Implement this elegant MST algorithm. It likely uses a union-find as an auxiliary DS from the quick read I've done but perhaps not.

williamfiset

Implementation of bidirectional search using forward and backward BFS. Also can find intersecting node between the two BFS's.

johanekb

Add plane-plane intersection algorithm

1

williamfiset

The class TspDynamicProgrammingIterative currently has 81% branch coverage and can be extended to have 100% coverage. There are no tests for checking too large distance matrices, and there are also...

Aleks-Petkov