Pagini recente » Clasament test_practic_pa_1 | Diferente pentru runda/runda_ezoterica_5 intre reviziile 2 si 1 | Istoria paginii preoni-2008/runda-1/solutii | Diferente pentru runda/carantinanuneopresteagmbiruieste intre reviziile 4 si 3 | Diferente pentru blog/meet-in-the-middle intre reviziile 90 si 89
Nu exista diferente intre titluri.
Diferente intre continut:
bq. Find the shortest path between two nodes nodes in a large graph which you can’t keep in memory, for example the Facebook friendship graph.
!blog/meet-in-the-middle?12fig26.gif!
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.
!blog/meet-in-the-middle?12fig26.gif! 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.
