Commit 872a2d92 authored by Akdel's avatar Akdel
Browse files

debug (removed njit)

parent a756da5c
......@@ -13,7 +13,7 @@ import numpy as np
# 5. Start the algorithm again, replacing the pair of joined neighbors with the new node and using the distances calculated in the previous step.
@nb.njit
# @nb.njit
# @numba_cc.export('neighbor_joining', '(f64[:])')
def neighbor_joining(distance_matrix: np.ndarray) -> (np.ndarray, np.ndarray):
"""
......@@ -88,7 +88,7 @@ def neighbor_joining(distance_matrix: np.ndarray) -> (np.ndarray, np.ndarray):
# Q matrix calculation + minimum i, j (step 1 & 2)
@nb.njit
# @nb.njit
# @numba_cc.export('_find_join_nodes', '(f64[:])')
def _find_join_nodes(distance_matrix):
"""
......@@ -119,7 +119,7 @@ def _find_join_nodes(distance_matrix):
# Branch length calculation (step 3)
@nb.njit
# @nb.njit
# @numba_cc.export('_find_branch_length', '(f64[:], i64, i64)')
def _find_branch_length(distance_matrix, i, j):
"""
......
Supports Markdown
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment