Home | History | Annotate | Download | only in Format

Lines Matching refs:InitialState

892   /// \brief Analyze the entire solution space starting from \p InitialState.
896   /// find the shortest path (the one with lowest penalty) from \p InitialState
898   unsigned analyzeSolutionSpace(LineState &InitialState) {
903         new (Allocator.Allocate()) StateNode(InitialState, false, NULL);
931     reconstructPath(InitialState, Queue.top().second);