Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

makes umi_tools deterministic with --random-seed #550

Open
wants to merge 4 commits into
base: master
Choose a base branch
from
Open

makes umi_tools deterministic with --random-seed #550

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
4 commits
Select commit Hold shift + click to select a range
6db7f76
makes umi_tools deterministic with --random-seed
TomSmithCGAT Aug 4, 2022
726ac72
git commit to re-trigger tests
TomSmithCGAT Mar 2, 2023
9ccf700
another test re-trigger (output from previous was lost)
TomSmithCGAT Jun 13, 2023
5c0d427
Remove py3.6 from testing
TomSmithCGAT Jun 13, 2023
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Jump to
Jump to file
Failed to load files.
Diff view
Diff view
2 changes: 1 addition & 1 deletion .github/workflows/nosetests.yml
View file
Open in desktop
Expand Up @@ -8,7 +8,7 @@ jobs:
runs-on: ${{ matrix.os }}
strategy:
matrix:
python-version: ["3.6", "3.7", "3.8", "3.9"]
python-version: ["3.7", "3.8", "3.9"]
os: [ubuntu-latest, macOS-latest]

steps:
Expand Down
1 change: 0 additions & 1 deletion README.rst
View file
Open in desktop
Expand Up @@ -121,4 +121,3 @@ Dependencies
------------
umi_tools is dependent on `python>=3.5`, `numpy`, `pandas`, `scipy`, `cython`, `pysam`,
`future`, `regex` and `matplotlib`

4 changes: 3 additions & 1 deletion umi_tools/network.py
View file
Open in desktop
Expand Up @@ -227,7 +227,8 @@ def _get_connected_components_adjacency(self, umis, graph, counts):
for node in sorted(graph, key=lambda x: counts[x], reverse=True):
if node not in found:
# component = self.search(node, graph)
component = breadth_first_search(node, graph)
component = list(breadth_first_search(node, graph))
component.sort()
found.update(component)
components.append(component)
return components
Expand Down Expand Up @@ -506,6 +507,7 @@ def _get_connected_components_adjacency(self, graph, counts):
if node not in found:
# component = self.search(node, graph)
component = breadth_first_search(node, graph)
component.sort()
found.update(component)
components.append(component)
return components
Expand Down