MCPcopy Index your code
hub / github.com/algorithmicsuperintelligence/optillm / select_final_trajectory

Method select_final_trajectory

optillm/rstar.py:214–221  ·  view source on GitHub ↗
(self, trajectories: List[List[Node]])

Source from the content-addressed store, hash-verified

212 return is_consistent
213
214 def select_final_trajectory(self, trajectories: List[List[Node]]) -> List[Node]:
215 logger.debug("Selecting final trajectory")
216 valid_trajectories = [t for t in trajectories if self.mutual_consistency(t)]
217 logger.debug(f"Found {len(valid_trajectories)} valid trajectories")
218 if not valid_trajectories:
219 logger.warning("No valid trajectories found. Selecting based on value/visits.")
220 return max(trajectories, key=lambda t: self.trajectory_score(t))
221 return max(valid_trajectories, key=lambda t: self.trajectory_score(t))
222
223 def trajectory_score(self, trajectory: List[Node]) -> float:
224 if not trajectory:

Callers 1

solve_asyncMethod · 0.95

Calls 2

mutual_consistencyMethod · 0.95
trajectory_scoreMethod · 0.95

Tested by

no test coverage detected