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
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
| using System;
using System.Collections.Generic;
using UnityEngine;
using UnityEngine.AddressableAssets;
public class DependencyVisualizer
{
[System.Serializable]
public class DependencyNode
{
public string address;
public string type;
public List<string> dependencies;
public List<string> dependents;
public int depth;
public bool isRoot;
public long size;
}
[System.Serializable]
public class DependencyGraph
{
public List<DependencyNode> nodes;
public string[] rootNodes;
}
public static DependencyGraph AnalyzeDependencies(string[] rootAddresses)
{
var graph = new DependencyGraph
{
nodes = new List<DependencyNode>(),
rootNodes = rootAddresses
};
var processed = new HashSet<string>();
var queue = new Queue<string>();
foreach (string address in rootAddresses)
{
queue.Enqueue(address);
}
while (queue.Count > 0)
{
string currentAddress = queue.Dequeue();
if (processed.Contains(currentAddress))
continue;
processed.Add(currentAddress);
var node = CreateDependencyNode(currentAddress);
graph.nodes.Add(node);
foreach (string dependency in node.dependencies)
{
if (!processed.Contains(dependency))
{
queue.Enqueue(dependency);
}
}
}
return graph;
}
private static DependencyNode CreateDependencyNode(string address)
{
var node = new DependencyNode
{
address = address,
dependencies = new List<string>(),
dependents = new List<string>(),
isRoot = true
};
node.dependencies = GetDependencies(address);
node.size = EstimateAssetSize(address);
return node;
}
private static List<string> GetDependencies(string address)
{
return new List<string>();
}
private static long EstimateAssetSize(string address)
{
return 1024 * 1024;
}
public static string GenerateDependencyTree(DependencyGraph graph, string rootAddress)
{
var tree = new System.Text.StringBuilder();
tree.AppendLine($"=== 依赖关系树: {rootAddress} ===");
var nodeMap = new Dictionary<string, DependencyNode>();
foreach (var node in graph.nodes)
{
nodeMap[node.address] = node;
}
var visited = new HashSet<string>();
BuildDependencyTree(tree, rootAddress, nodeMap, visited, 0);
return tree.ToString();
}
private static void BuildDependencyTree(System.Text.StringBuilder tree, string address,
Dictionary<string, DependencyNode> nodeMap, HashSet<string> visited, int depth)
{
if (visited.Contains(address) || !nodeMap.ContainsKey(address))
return;
visited.Add(address);
var node = nodeMap[address];
string indent = new string(' ', depth * 2);
tree.AppendLine($"{indent}{node.address} ({BuildLayoutReportGenerator.FormatFileSize(node.size)})");
foreach (string dependency in node.dependencies)
{
BuildDependencyTree(tree, dependency, nodeMap, visited, depth + 1);
}
}
public static List<string> FindCircularDependencies(DependencyGraph graph)
{
var circularDeps = new List<string>();
var allNodes = new Dictionary<string, DependencyNode>();
foreach (var node in graph.nodes)
{
allNodes[node.address] = node;
}
foreach (var node in graph.nodes)
{
var path = new List<string>();
if (HasCircularDependency(node.address, allNodes, path))
{
circularDeps.Add($"循环依赖: {string.Join(" -> ", path)} -> {node.address}");
}
}
return circularDeps;
}
private static bool HasCircularDependency(string current, Dictionary<string, DependencyNode> nodes,
List<string> path)
{
if (path.Contains(current))
{
path.Add(current);
return true;
}
if (!nodes.ContainsKey(current))
return false;
path.Add(current);
var node = nodes[current];
foreach (string dependency in node.dependencies)
{
if (HasCircularDependency(dependency, nodes, new List<string>(path)))
{
return true;
}
}
return false;
}
public static string GenerateDependencyStats(DependencyGraph graph)
{
int totalNodes = graph.nodes.Count;
int totalDependencies = 0;
long totalSize = 0;
int maxDepth = 0;
foreach (var node in graph.nodes)
{
totalDependencies += node.dependencies.Count;
totalSize += node.size;
if (node.dependencies.Count > 0)
{
maxDepth = Math.Max(maxDepth, CalculateMaxDepth(node.address, graph));
}
}
float avgDependencies = totalNodes > 0 ? (float)totalDependencies / totalNodes : 0;
var stats = new System.Text.StringBuilder();
stats.AppendLine("=== 依赖关系统计 ===");
stats.AppendLine($"节点数量: {totalNodes}");
stats.AppendLine($"总依赖数: {totalDependencies}");
stats.AppendLine($"平均依赖数: {avgDependencies:F2}");
stats.AppendLine($"总大小: {BuildLayoutReportGenerator.FormatFileSize(totalSize)}");
stats.AppendLine($"最大依赖深度: {maxDepth}");
return stats.ToString();
}
private static int CalculateMaxDepth(string address, DependencyGraph graph)
{
var nodeMap = new Dictionary<string, DependencyNode>();
foreach (var node in graph.nodes)
{
nodeMap[node.address] = node;
}
return CalculateMaxDepthRecursive(address, nodeMap, new HashSet<string>(), 0);
}
private static int CalculateMaxDepthRecursive(string address, Dictionary<string, DependencyNode> nodeMap,
HashSet<string> visited, int currentDepth)
{
if (!nodeMap.ContainsKey(address) || visited.Contains(address))
return currentDepth;
visited.Add(address);
var node = nodeMap[address];
int maxDepth = currentDepth;
foreach (string dependency in node.dependencies)
{
int depth = CalculateMaxDepthRecursive(dependency, nodeMap,
new HashSet<string>(visited), currentDepth + 1);
maxDepth = Math.Max(maxDepth, depth);
}
return maxDepth;
}
}
|
