Pagini recente » Profil andrei20003 | Atasamentele paginii Profil dimitrienrj | Atasamentele paginii Clasament sfqw | Antocod | Diferente pentru blog/meet-in-the-middle intre reviziile 111 si 110
Nu exista diferente intre titluri.
Diferente intre continut:
!blog/meet-in-the-middle?12fig26.gif!
image from http://goo.gl/6zne3
The breadth first search algorithm is a standard approach for this problem. If the distance between two nodes is $k$ and the average degree in the network is $p$ BFS explores $O(p^k^)$ nodes.
A better solution starts from both nodes and sees when the two search spaces meet. This reduces the number of states explored to $O(p^k/2^)$.
Nu exista diferente intre securitate.
Topicul de forum nu a fost schimbat.
