diff options
| author | Hui Lan <lanhui@zjnu.edu.cn> | 2020-02-11 18:26:16 +0800 |
|---|---|---|
| committer | Hui Lan <lanhui@zjnu.edu.cn> | 2020-02-11 18:26:16 +0800 |
| commit | ee13c5dbc0bc682e4117d04d4de9e8a4e71ecc04 (patch) | |
| tree | aec0bb6c0b2c063a3ee294602735bfd9e9fd833f /Code | |
| parent | b249f04c0bd3fa7c51400b1672d3f30fa0a7ff3a (diff) | |
merge_edges.py: add a few comments for function make_new_edge.
Diffstat (limited to 'Code')
| -rw-r--r-- | Code/merge_edges.py | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/Code/merge_edges.py b/Code/merge_edges.py index 5d56223..5e9548d 100644 --- a/Code/merge_edges.py +++ b/Code/merge_edges.py @@ -119,10 +119,10 @@ def compute_time_difference_in_days(t1, t2): def make_new_edge(lst_tuple): - lst = sorted(lst_tuple, reverse=True, key = lambda x: abs(float(x[2]))) # sort according to absolute value of score - best_edge = list( lst[0] ) + lst = sorted(lst_tuple, reverse=True, key = lambda x: abs(float(x[2]))) # sort tuples according to absolute value of score + best_edge = list( lst[0] ) # use the first tuple as a basis edge - # see section 'Ranking edges using frecency' in the brain documentation + # see section 'Ranking edges using frecency' in the brain documentation F = len(lst_tuple) RN_lst = [] |