In some texts (many), where the algorithm BFS is explained (Search in width - < em> Breadth First Search ) is a section that says that the complexity of this is O(v+e) , or failing O(v2) . That is, a problem P, but in some AI texts...
asked on
17.06.2016 / 22:19