@@ -258,7 +258,7 @@ def get_mut_lik_fixed_node(self, edge):
258
258
259
259
mutations_on_edge = self .mut_edges [edge .id ]
260
260
child_time = self .ts .node (edge .child ).time
261
- assert child_time == 0
261
+ # assert child_time == 0
262
262
# Temporary hack - we should really take a more precise likelihood
263
263
return self ._lik (
264
264
mutations_on_edge ,
@@ -732,10 +732,10 @@ def outside_pass(
732
732
if ignore_oldest_root :
733
733
if edge .parent == self .ts .num_nodes - 1 :
734
734
continue
735
- if edge .parent in self .fixednodes :
736
- raise RuntimeError (
737
- "Fixed nodes cannot currently be parents in the TS"
738
- )
735
+ # if edge.parent in self.fixednodes:
736
+ # raise RuntimeError(
737
+ # "Fixed nodes cannot currently be parents in the TS"
738
+ # )
739
739
# Geometric scaling works exactly for all nodes fixed in graph
740
740
# but is an approximation when times are unknown.
741
741
spanfrac = edge .span / self .spans [child ]
@@ -1065,9 +1065,9 @@ def get_dates(
1065
1065
:return: tuple(mn_post, posterior, timepoints, eps, nodes_to_date)
1066
1066
"""
1067
1067
# Stuff yet to be implemented. These can be deleted once fixed
1068
- for sample in tree_sequence .samples ():
1069
- if tree_sequence .node (sample ).time != 0 :
1070
- raise NotImplementedError ("Samples must all be at time 0" )
1068
+ # for sample in tree_sequence.samples():
1069
+ # if tree_sequence.node(sample).time != 0:
1070
+ # raise NotImplementedError("Samples must all be at time 0")
1071
1071
fixed_nodes = set (tree_sequence .samples ())
1072
1072
1073
1073
# Default to not creating approximate priors unless ts has > 1000 samples
0 commit comments