comparison toolboxes/graph_visualisation/share/man/man1/dijkstra.1 @ 0:cc4b1211e677 tip

initial commit to HG from Changeset: 646 (e263d8a21543) added further path and more save "camirversion.m"
author Daniel Wolff
date Fri, 19 Aug 2016 13:07:06 +0200
parents
children
comparison
equal deleted inserted replaced
-1:000000000000 0:cc4b1211e677
1 .TH DIJKSTRA 1 "21 March 2001"
2 .SH NAME
3 dijkstra \- single-source distance filter
4 .SH SYNOPSIS
5 .B dijkstra
6 [
7 .B \-ap?
8 ]
9 [
10 .I sourcenode file
11 ]
12 .SH DESCRIPTION
13 .B dijkstra
14 reads a stream of graphs and for each computes the distance of every
15 node from
16 .I sourcenode.
17 Edge length is given in the
18 .I len
19 attribute, and the default is 1. The
20 .I dist
21 attribute of every node is set to its distance from
22 .I sourcenode.
23 If the \fB-p\fP flag is used, the
24 .I prev
25 attribute of each node reachable from
26 .I sourcenode
27 is set to the name of the previous node on a shortest path.
28 The graph attribute
29 .I maxdist
30 is set to the maximum
31 .I dist
32 of all nodes in the graph.
33 .P
34 By default, if the graph is disconnected, the
35 .I dist
36 attribute of nodes unreachable from
37 .I sourcenode
38 are left untouched, and
39 .I maxdist
40 is set to the maximum of any previous value and the largest
41 distance recorded in this run. On the other hand, if
42 the \fB-a\fP flag is used, the
43 .I dist
44 attribute of an unreachable node is assigned a very large value,
45 and
46 .I maxdist
47 records the maximum distance found in the component containing
48 .I sourcenode.
49 .P
50 Any number of
51 .I sourcenode file
52 pairs may be given.
53 If the last
54 .I file
55 is missing, \fBstdin\fP is used.
56 All output is written to \fBstdout\fP.
57 .P
58 In a typical application,
59 .I dist
60 and
61 .I maxdist
62 can drive a downstream calculation of color or some other attribute.
63 .SH "SEE ALSO"
64 gvpr(1), gvcolor(1), libgraph(3)