本文整理汇总了Python中apgl.graph.SparseGraph.SparseGraph.findAllDistances方法的典型用法代码示例。如果您正苦于以下问题：Python SparseGraph.findAllDistances方法的具体用法？Python SparseGraph.findAllDistances怎么用？Python SparseGraph.findAllDistances使用的例子？那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类apgl.graph.SparseGraph.SparseGraph的用法示例。
在下文中一共展示了SparseGraph.findAllDistances方法的1个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的Python代码示例。
示例1: GeneralVertexList
# 需要导入模块: from apgl.graph.SparseGraph import SparseGraph [as 别名]
# 或者: from apgl.graph.SparseGraph.SparseGraph import findAllDistances [as 别名]
# -*- coding: utf-8 -*-
# g.findAllDistances demonstration
from apgl.graph.SparseGraph import SparseGraph
# from apgl.graph.PySparseGraph import PySparseGraph
from apgl.graph.GeneralVertexList import GeneralVertexList
# Make a graph.
numVertices = 6
vlist = GeneralVertexList(numVertices)
graph = SparseGraph(vlist, undirected=True)
# Define edges.
graph[0, 1] = 10.0
graph[0, 2] = 14.0
graph[0, 3] = 12.0
graph[1, 2] = 8.0
graph[1, 4] = 19.0
graph[2, 3] = 7.0
graph[2, 5] = 22.0
graph[3, 5] = 21.0
graph[4, 5] = 11.0
# Compute the shortest paths by means of Dijkstra's algorithm.
dists = graph.findAllDistances(True)
# Obtain the distance of the shortest path.
print(dists)