wuggy/Dactyloidae
wuggy/Dactyloidae
1
0
Fork 0
mirror of https://repo.dactyloidae.xyz/Dactyloidae/UXP.git synced 2026-09-06 15:58:39 +09:00
Code Issues Projects Releases Packages Wiki Activity

import FIREFOX_52_6_0esr_RELEASE from mozilla-esr52 hg repo

Browse source
This commit is contained in:
Roy Tam 2018-01-19 03:59:58 +08:00
commit dcd9973243
150858 changed files with 23884658 additions and 0 deletions
Download patch file Download diff file Expand all files Collapse all files

26
python/altgraph/doc/graphalgo.rst Normal file
View file

@ -0,0 +1,26 @@
:mod:`altgraph.GraphAlgo` --- Graph algorithms
==================================================
.. module:: altgraph.GraphAlgo
:synopsis: Basic graphs algoritms
.. function:: dijkstra(graph, start[, end])
Dijkstra's algorithm for shortest paths.
Find shortest paths from the start node to all nodes nearer
than or equal to the *end* node. The edge data is assumed to be the edge length.
.. note::
Dijkstra's algorithm is only guaranteed to work correctly when all edge lengths are positive.
This code does not verify this property for all edges (only the edges examined until the end
vertex is reached), but will correctly compute shortest paths even for some graphs with negative
edges, and will raise an exception if it discovers that a negative edge has caused it to make a mistake.
.. function:: shortest_path(graph, start, end)
Find a single shortest path from the given start node to the given end node.
The input has the same conventions as :func:`dijkstra`. The output is a list
of the nodes in order along the shortest path.