Skip to content

web search done right

Counter hashmaps should be dropped when we don't need them anymore

Mikkel Denkerfba49145e7ad
diff --git a/core/src/webgraph/centrality/online_harmonic.rs b/core/src/webgraph/centrality/online_harmonic.rs
index 5616032a..f0e07c27 100644
--- a/core/src/webgraph/centrality/online_harmonic.rs
+++ b/core/src/webgraph/centrality/online_harmonic.rs
@@ -305,6 +305,9 @@ impl OnlineHarmonicCentrality {
}
}
+ drop(in_degree);
+ drop(out_degree);
+
let proxy_nodes: Vec<_> = nodes
.into_iter()
.map(|candidate| candidate.node)
diff --git a/core/src/webgraph/mod.rs b/core/src/webgraph/mod.rs
index b4af1070..fb5adaef 100644
--- a/core/src/webgraph/mod.rs
+++ b/core/src/webgraph/mod.rs
@@ -109,9 +109,9 @@ impl From<Url> for Node {
#[derive(Debug, Clone, PartialEq, Eq, PartialOrd, Ord, Serialize, Deserialize)]
pub struct Edge {
- from: NodeID,
- to: NodeID,
- label: String,
+ pub from: NodeID,
+ pub to: NodeID,
+ pub label: String,
}
#[derive(Debug, Clone, PartialEq, Eq, Serialize, Deserialize)]