tools/telemetry/third_party/altgraph/doc/graphalgo.rst - Issue 1647513002: Delete tools/telemetry.

Side by Side Diff

Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.

Keyboard Shortcuts

	File
u :	up to issue
j / k :	jump to file after / before current file
J / K :	jump to next file with a comment after / before current file
	Side-by-side diff
i :	toggle intra-line diffs
e :	expand all comments
c :	collapse all comments
s :	toggle showing all comments
n / p :	next / previous diff chunk or comment
N / P :	next / previous comment
<Up> / <Down> :	next / previous line

	Issue
u :	up to list of issues
j / k :	jump to patch after / before current patch
o / <Enter> :	open current patch in side-by-side view
i :	open current patch in unified diff view

	Issue List
j / k :	jump to issue after / before current issue
o / <Enter> :	open current issue

Side by Side Diff: tools/telemetry/third_party/altgraph/doc/graphalgo.rst

Issue 1647513002: Delete tools/telemetry. (Closed) Base URL: https://chromium.googlesource.com/chromium/src.git@master

Patch Set: Created 4 years, 10 months ago

Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.

Jump to:

OLD	NEW
	(Empty)
1 :mod:`altgraph.GraphAlgo` --- Graph algorithms

2 ==================================================

3

4 .. module:: altgraph.GraphAlgo

5 :synopsis: Basic graphs algoritms

6

7 .. function:: dijkstra(graph, start[, end])

8

9 Dijkstra's algorithm for shortest paths.

10

11 Find shortest paths from the start node to all nodes nearer

12 than or equal to the end node. The edge data is assumed to be the edge leng th.

13

14 .. note::

15

16 Dijkstra's algorithm is only guaranteed to work correctly when all edge l engths are positive.

17 This code does not verify this property for all edges (only the edges exa mined until the end

18 vertex is reached), but will correctly compute shortest paths even for so me graphs with negative

19 edges, and will raise an exception if it discovers that a negative edge h as caused it to make a mistake.

20

21

22 .. function:: shortest_path(graph, start, end)

23

24 Find a single shortest path from the given start node to the given end node.

25 The input has the same conventions as :func:`dijkstra`. The output is a list

26 of the nodes in order along the shortest path.

OLD	NEW