Pagini recente » Atasamentele paginii Siruri4 | Diferente pentru problema/cifru5 intre reviziile 5 si 6 | Diferente pentru problema/jimmy intre reviziile 3 si 2 | Atasamentele paginii Ratway | Diferente pentru blog/meet-in-the-middle intre reviziile 1 si 2
Nu exista diferente intre titluri.
Diferente intre continut:
h2. Bidirectional search
q. Find the shortest path between two nodes nodes in a large graph which you can’t keep in memory, for example the web graph of the facebook friendship graph, find out the shortest path between them.
bq. Find the shortest path between two nodes nodes in a large graph which you can’t keep in memory, for example the web graph of the facebook friendship graph, find out the shortest path between them.
One neat idea is instead of starting the search from one node, start from both and see when the two search spaces meet. If the distance between two nodes is k and the average branching factor in the network is p then we explore O(p^(k/2)) nodes instead of O(p^k) nodes.
Nu exista diferente intre securitate.
Topicul de forum nu a fost schimbat.
