サンプル

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

匿名