mirror of
https://github.com/lukefleed/imdb-graph.git
synced 2026-10-09 06:37:01 +00:00
last minute typos
This commit is contained in:
@@ -128,7 +128,7 @@ df_film.query('not isAdult and titleType in ["movie", "tvSeries", "tvMovie", "tv
|
||||
filtered_tconsts = df_film["tconst"].to_list()
|
||||
``` -->
|
||||
|
||||
Then we can generate the final filtered file `FilmFiltrati.txt` that has only two columns: `tconst` and `primaryName`
|
||||
Then we can generate the final filtered file `FilmFiltrati.txt` that has only two columns: `tconst` and `primaryTitle`
|
||||
|
||||
---
|
||||
|
||||
|
||||
+1
-1
@@ -196,7 +196,7 @@ vector<pair<int, double>> closeness(const size_t k) {
|
||||
for (int actor_id = start; actor_id <= MAX_ACTOR_ID; actor_id += N_THREADS) {
|
||||
if (!A.count(actor_id)) // The actor must exist, otherwise A[actor_id] would attempt to write A, and this may produce a race condition if multiple threads do it at the same time
|
||||
continue;
|
||||
// if |Top| ≥ k and L[v] > Farn[Top[k]] then return Top; => We can not exploit the lower bound of our vertex to stop the loop, as we are not updating lower bounds L.
|
||||
|
||||
// We just compute the farness of our vertex using a BFS
|
||||
queue<pair<int,int>> q; // FIFO of pairs (actor_index, distance from our vertex).
|
||||
for (size_t i = 0; i < enqueued.size(); i++)
|
||||
|
||||
Reference in New Issue
Block a user