1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
// Graph algorithms: filtering, PageRank scoring, and graph pruning
/// Filters dependency graph to only include call edges
///
/// # Examples
///
/// ```rust,no_run
/// use pmat::services::dag_builder::filter_call_edges;
/// use pmat::models::dag::{DependencyGraph, EdgeType};
///
/// let graph = DependencyGraph::new();
/// let filtered = filter_call_edges(graph);
/// // All edges in filtered graph will be EdgeType::Calls
/// ```
#[must_use]
pub fn filter_call_edges(graph: DependencyGraph) -> DependencyGraph {
graph.filter_by_edge_type(EdgeType::Calls)
}
/// Filters dependency graph to only include import edges
///
/// # Examples
///
/// ```rust,no_run
/// use pmat::services::dag_builder::filter_import_edges;
/// use pmat::models::dag::{DependencyGraph, EdgeType};
///
/// let graph = DependencyGraph::new();
/// let filtered = filter_import_edges(graph);
/// // All edges in filtered graph will be EdgeType::Imports
/// ```
#[must_use]
pub fn filter_import_edges(graph: DependencyGraph) -> DependencyGraph {
graph.filter_by_edge_type(EdgeType::Imports)
}
/// Filters dependency graph to only include inheritance edges
///
/// # Examples
///
/// ```rust,no_run
/// use pmat::services::dag_builder::filter_inheritance_edges;
/// use pmat::models::dag::{DependencyGraph, EdgeType};
///
/// let graph = DependencyGraph::new();
/// let filtered = filter_inheritance_edges(graph);
/// // All edges in filtered graph will be EdgeType::Inherits
/// ```
#[must_use]
pub fn filter_inheritance_edges(graph: DependencyGraph) -> DependencyGraph {
graph.filter_by_edge_type(EdgeType::Inherits)
}
/// Add `PageRank` scores to all nodes in the graph (in-place mutation, no clone)
///
/// # Examples
///
/// ```rust,no_run
/// use pmat::services::dag_builder::add_pagerank_scores;
/// use pmat::models::dag::DependencyGraph;
///
/// let graph = DependencyGraph::new();
/// let scored_graph = add_pagerank_scores(graph); // takes ownership, no clone
/// // Graph nodes now have PageRank scores in metadata
/// ```
#[must_use]
pub fn add_pagerank_scores(mut graph: DependencyGraph) -> DependencyGraph {
if graph.nodes.is_empty() {
return graph;
}
let scores = compute_pagerank_scores(&graph);
// Mutate nodes in-place to add centrality scores (avoids full graph clone)
let node_ids: Vec<String> = graph.nodes.keys().cloned().collect();
for (idx, id) in node_ids.iter().enumerate() {
if let Some(node) = graph.nodes.get_mut(id) {
node.metadata
.insert("centrality".to_string(), scores[idx].to_string());
}
}
graph
}
/// Prune graph using `PageRank` algorithm to keep only the most important nodes
#[must_use]
pub fn prune_graph_pagerank(graph: &DependencyGraph, max_nodes: usize) -> DependencyGraph {
if graph.nodes.len() <= max_nodes {
return graph.clone();
}
let scores = compute_pagerank_scores(graph);
let node_ids: Vec<&String> = graph.nodes.keys().collect();
// Select top-k nodes
let mut ranked: Vec<_> = scores.iter().enumerate().collect();
ranked.sort_by(|a, b| b.1.total_cmp(a.1));
let keep: FxHashSet<&String> = ranked
.iter()
.take(max_nodes)
.map(|(i, _)| node_ids[*i])
.collect();
// Create nodes with centrality scores in metadata
let mut nodes_with_centrality = FxHashMap::default();
for (id, node) in &graph.nodes {
if keep.contains(id) {
let mut node_copy = node.clone();
if let Some(idx) = node_ids.iter().position(|&nid| nid == id) {
node_copy
.metadata
.insert("centrality".to_string(), scores[idx].to_string());
}
nodes_with_centrality.insert(id.clone(), node_copy);
}
}
DependencyGraph {
nodes: nodes_with_centrality,
edges: graph
.edges
.iter()
.filter(|e| keep.contains(&e.from) && keep.contains(&e.to))
.cloned()
.collect(),
}
}
/// Shared PageRank computation used by both `add_pagerank_scores` and `prune_graph_pagerank`
fn compute_pagerank_scores(graph: &DependencyGraph) -> Vec<f32> {
let node_ids: Vec<&String> = graph.nodes.keys().collect();
let mut scores = vec![1.0f32; node_ids.len()];
let node_idx: FxHashMap<&String, usize> = node_ids
.iter()
.enumerate()
.map(|(i, &id)| (id, i))
.collect();
// Precompute out-degrees for O(1) lookup
let mut out_degrees = vec![0u32; node_ids.len()];
for edge in &graph.edges {
if let Some(&from) = node_idx.get(&edge.from) {
out_degrees[from] += 1;
}
}
// 10 iterations sufficient for ranking
for _ in 0..10 {
let mut new_scores = vec![0.15f32; scores.len()];
for edge in &graph.edges {
if let (Some(&from), Some(&to)) = (node_idx.get(&edge.from), node_idx.get(&edge.to)) {
let out_degree = out_degrees[from] as f32;
if out_degree > 0.0 {
new_scores[to] += 0.85 * scores[from] / out_degree;
}
}
}
scores = new_scores;
}
scores
}