|
Rename Method public search(p Problem) : List<Action> renamed to public findActions(p Problem) : List<Action> in class aima.core.search.framework.SearchForActions |
From |
To |
|
Rename Method public search(problem Problem, frontier Queue<Node>) : Node renamed to public findNode(problem Problem, frontier Queue<Node>) : Node in class aima.core.search.framework.qsearch.GraphSearchBFS |
From |
To |
|
Rename Method public search(p Problem) : List<Action> renamed to public findActions(p Problem) : List<Action> in class aima.core.search.local.SimulatedAnnealingSearch |
From |
To |
|
Rename Method public searchState(p Problem) : Object renamed to public findState(p Problem) : Object in class aima.core.search.framework.PrioritySearch |
From |
To |
|
Rename Method public search(problem Problem, frontier Queue<Node>) : Node renamed to public findNode(problem Problem, frontier Queue<Node>) : Node in class aima.core.search.framework.qsearch.QueueSearch |
From |
To |
|
Rename Method public searchState(p Problem) : Object renamed to public findState(p Problem) : Object in class aima.core.search.local.HillClimbingSearch |
From |
To |
|
Rename Method public search(p Problem) : List<Action> renamed to public findActions(p Problem) : List<Action> in class aima.core.search.informed.RecursiveBestFirstSearch |
From |
To |
|
Rename Method public searchState(p Problem) : Object renamed to public findState(p Problem) : Object in class aima.core.search.local.SimulatedAnnealingSearch |
From |
To |
|
Rename Method public searchState(p Problem) : Object renamed to public findState(p Problem) : Object in class aima.core.search.uninformed.DepthFirstSearch |
From |
To |
|
Rename Method public searchState(p Problem) : Object renamed to public findState(p Problem) : Object in class aima.core.search.uninformed.BreadthFirstSearch |
From |
To |
|
Rename Method public search(problem Problem, frontier Queue<Node>) : Node renamed to public findNode(problem Problem, frontier Queue<Node>) : Node in class aima.core.search.framework.qsearch.GraphSearchReducedFrontier |
From |
To |
|
Rename Method public search(p Problem) : List<Action> renamed to public findNode(p Problem) : Node in class aima.core.search.uninformed.DepthLimitedSearch |
From |
To |
|
Rename Method public search(problem Problem, frontier Queue<Node>) : Node renamed to public findNode(problem Problem, frontier Queue<Node>) : Node in class aima.core.search.framework.qsearch.GraphSearch |
From |
To |
|
Rename Method public searchState(p Problem) : Object renamed to public findState(p Problem) : Object in class aima.core.search.framework.SearchForStates |
From |
To |
|
Rename Method public search(p Problem) : List<Action> renamed to public findActions(p Problem) : List<Action> in class aima.core.search.uninformed.BreadthFirstSearch |
From |
To |
|
Rename Method public search(p Problem) : List<Action> renamed to private findNode(p Problem) : Node in class aima.core.search.uninformed.IterativeDeepeningSearch |
From |
To |
|
Rename Method public searchNode(p Problem) : Node renamed to public findNode(p Problem) : Node in class aima.core.search.local.SimulatedAnnealingSearch |
From |
To |
|
Rename Method public search(p Problem) : List<Action> renamed to public findActions(p Problem) : List<Action> in class aima.core.search.framework.PrioritySearch |
From |
To |
|
Rename Method public search(p Problem) : List<Action> renamed to public findActions(p Problem) : List<Action> in class aima.core.search.local.HillClimbingSearch |
From |
To |
|
Rename Method public search(p Problem) : List<Action> renamed to public findActions(p Problem) : List<Action> in class aima.core.search.uninformed.DepthFirstSearch |
From |
To |
|
Rename Method public search(problem Problem, frontier Queue<Node>) : Node renamed to public findNode(problem Problem, frontier Queue<Node>) : Node in class aima.core.search.framework.qsearch.BidirectionalSearch |
From |
To |