machine-learning-algorithms

Added a cpp file for Floyd Algorithm for cycle detection Description of Change

Checklist

• Added de

Description of Change

References

Checklist

Describe the bug
Clipping a DataFrame or Series using ints causes a cudf Failure because it won't handle the different dtypes (int and float)

Steps/Code to reproduce bug

data = cudf.Series([-0.43, 0.1234, 1.5, -1.31])
data.clip(0, 1)

...
  File "cudf/_lib/replace.pyx", line 216, in cudf._lib.replace.clip
  File "cudf/_lib/replace.pyx", line 198, in cudf._lib.replace.clamp

Description

I'm the creator and only maintainer of the project at the moment. I'm working on adding new features and thus I would like to let this issue open for newcomers who want to contribute to the project.

Basically, I wrote the cli using argparse since it is part of the standard language already. However, I'm starting to rethin

Report needed documentation

Report needed documentation
While the estimator guide offers a great breakdown of how to use many of the tools in api_context_managers.py, it would be helpful to have information right in the docstring during development to more easily understand what is actually going on in each of the provided functions/classes/methods. This is particularly important for

Description

Currently our unit tests are disorganized and each test creates example StellarGraph graphs in different or similar ways with no sharing of this code.

This issue is to improve the unit tests by making functions to create example graphs available to all unit tests by, for example, making them pytest fixtures at the top level of the tests (see https://docs.pytest.org/en/latest/

Hi, Thanks for the awesome library!

So I am running a Kmeans on lots of different datasets, which all have roughly four shapes, so I initialize with those shapes and it works well, except for just a few times. There are a few datasets that look different enough that I end up with empty clusters and the algorithm just hangs ("Resumed because of empty cluster" again and again).

I conceptually