Loading...
Loading...
Compare original and translation side by side
| Type | Edges | Multiple Edges |
|---|---|---|
| Undirected | No |
| Directed | No |
| Undirected | Yes |
| Directed | Yes |
| 类型 | 边类型 | 允许多条边 |
|---|---|---|
| 无向 | 否 |
| 有向 | 否 |
| 无向 | 是 |
| 有向 | 是 |
| Measure | What It Finds | Use Case |
|---|---|---|
| Degree | Most connections | Popular nodes |
| Betweenness | Bridge nodes | Information flow |
| Closeness | Fastest reach | Efficient spreaders |
| PageRank | Importance | Web pages, citations |
| Eigenvector | Influential connections | Who knows important people |
| 指标 | 作用 | 适用场景 |
|---|---|---|
| Degree | 找出连接数最多的节点 | 热门节点识别 |
| Betweenness | 找出桥接节点 | 信息流分析 |
| Closeness | 找出最易触达的节点 | 高效传播者识别 |
| PageRank | 评估节点重要性 | 网页排名、引用分析 |
| Eigenvector | 找出连接重要节点的节点 | 影响力节点识别 |
| Algorithm | Purpose |
|---|---|
| Shortest path | Minimum hops |
| Weighted shortest | Minimum cost |
| All pairs shortest | Full distance matrix |
| Dijkstra | Efficient weighted paths |
| 算法 | 用途 |
|---|---|
| Shortest path | 寻找最少跳数路径 |
| Weighted shortest | 寻找最低成本路径 |
| All pairs shortest | 生成全节点距离矩阵 |
| Dijkstra | 高效寻找带权路径 |
| Method | Approach |
|---|---|
| Louvain | Modularity optimization |
| Greedy modularity | Hierarchical merging |
| Label propagation | Fast, scalable |
| 方法 | 实现思路 |
|---|---|
| Louvain | 模块度优化 |
| Greedy modularity | 层次化合并 |
| Label propagation | 快速、可扩展 |
| Generator | Model |
|---|---|
| Erdős-Rényi | Random edges |
| Barabási-Albert | Preferential attachment (scale-free) |
| Watts-Strogatz | Small-world |
| Complete | All connected |
| 生成器 | 模型 |
|---|---|
| Erdős-Rényi | 随机边模型 |
| Barabási-Albert | 偏好依附模型（无标度） |
| Watts-Strogatz | 小世界模型 |
| Complete | 全连接模型 |
| Layout | Best For |
|---|---|
| Spring | General purpose |
| Circular | Regular structure |
| Kamada-Kawai | Aesthetics |
| Spectral | Clustered graphs |
| 布局 | 最佳适用场景 |
|---|---|
| Spring | 通用场景 |
| Circular | 规则结构 |
| Kamada-Kawai | 美观性优先 |
| Spectral | 聚类图 |
| Format | Preserves Attributes | Human Readable |
|---|---|---|
| GraphML | Yes | Yes (XML) |
| Edge list | No | Yes |
| JSON | Yes | Yes |
| Pandas | Yes | Via DataFrame |
| 格式 | 保留属性 | 人类可读性 |
|---|---|---|
| GraphML | 是 | 是（XML格式） |
| Edge list | 否 | 是 |
| JSON | 是 | 是 |
| Pandas | 是 | 通过DataFrame实现 |
| Scale | Approach |
|---|---|
| < 10K nodes | Any algorithm |
| 10K - 100K | Use approximate algorithms |
| > 100K | Consider graph-tool or igraph |
| 规模 | 处理方案 |
|---|---|
| < 10K 节点 | 任意算法均可 |
| 10K - 100K 节点 | 使用近似算法 |
| > 100K 节点 | 考虑使用graph-tool或igraph |