|
6 | 6 |
|
7 | 7 | import networkx as nx |
8 | 8 | import numpy as np |
9 | | -from motile import Solver, TrackGraph |
10 | | -from motile.constraints import MaxChildren, MaxParents, Pin |
11 | | -from motile.costs import Appear, EdgeDistance, EdgeSelection, Split |
12 | | -from motile_toolbox.candidate_graph import ( |
13 | | - EdgeAttr, |
14 | | - NodeAttr, |
| 9 | +from funtracks.candidate_graph import ( |
15 | 10 | compute_graph_from_points_list, |
16 | 11 | compute_graph_from_seg, |
17 | | - graph_to_nx, |
18 | 12 | ) |
| 13 | +from funtracks.data_model.graph_attributes import EdgeAttr, NodeAttr |
| 14 | +from motile import Solver, TrackGraph |
| 15 | +from motile.constraints import MaxChildren, MaxParents, Pin |
| 16 | +from motile.costs import Appear, EdgeDistance, EdgeSelection, Split |
| 17 | + |
| 18 | +from motile_tracker.motile.backend.graph_to_nx import graph_to_nx |
19 | 19 |
|
20 | 20 | from .solver_params import SolverParams |
21 | 21 |
|
@@ -51,8 +51,8 @@ def solve( |
51 | 51 |
|
52 | 52 | Returns: |
53 | 53 | nx.DiGraph: A solution graph where the ids of the nodes correspond to |
54 | | - the time and ids of the passed in segmentation labels. See the |
55 | | - motile_toolbox for exact implementation details. |
| 54 | + the time and ids of the passed in segmentation labels. See funtracks for exact |
| 55 | + implementation details. |
56 | 56 | """ |
57 | 57 | # Single window mode: slice input, solve, and return early |
58 | 58 | if ( |
|
0 commit comments