示例

verify pkg:pypi/networkx@3.6.1

sha256:2c00cc012c3f37750117837fc4b499f0c98034ad981d229aca7d943878de4ed1

MIT-0

执行证据

声明的环境与签名的运行分开呈现，你可以看到这个样本究竟运行了什么、在哪里运行。

声明的环境 python linux 24 · ubuntu · glibc 2.39 x64 python python pip

环境	契约	阶段	运行日期
python 3.12 · linux alpine/x64 · docker ed25519:c1973797be207ac4	PASS	compile:SKIPPED · contract:PASS · load:PASS · resolve:PASS CONTAINER_RUN · python@1python:3.12-alpine@sha256:d09d15e60962…	2026-08-27

HOW

目标: verify pkg:pypi/networkx@3.6.1
包: networkx 3.6.1
符号: networkx.Graph
networkx.DiGraph
networkx.shortest_path
networkx.dijkstra_path_length
networkx.has_path
networkx.is_connected
networkx.connected_components
networkx.is_strongly_connected
networkx.is_weakly_connected
networkx.strongly_connected_components
networkx.minimum_spanning_tree
networkx.degree_centrality
networkx.betweenness_centrality
networkx.closeness_centrality
networkx.NetworkXNoPath
networkx.NodeNotFound
环境: python
创建时间: 2026-08-27T18:09:50Z

assert shortest_path and dijkstra_path_length find the minimum-weight path and total weight on weighted graphs
assert has_path returns False and shortest_path raises NetworkXNoPath for disconnected nodes in the same graph
assert shortest_path raises NodeNotFound when either source or target node does not exist in the graph
assert is_connected and connected_components accurately identify connected components in undirected graphs
assert is_strongly_connected, is_weakly_connected and strongly_connected_components identify directed graph connectivity
assert minimum_spanning_tree computes the minimal spanning tree and preserves edge weight attributes
assert degree_centrality, betweenness_centrality and closeness_centrality compute standard structural metrics without optional dependencies
assert all_pairs_shortest_path_length and density compute global distance matrices and topological density

匿名