| Dir : /usr/share/graphviz/gvpr/ |
| Server: Linux server1.ngambekcore.com 4.18.0-553.51.1.el8_10.x86_64 #1 SMP Wed Apr 30 04:00:07 EDT 2025 x86_64 IP: 159.198.77.92 |
| Dir : //usr/share/graphviz/gvpr/dijkstra |
/* Given graph processed by dijkstra, and node,
* color shortest path
* Assumes path has been computed by dijkstra
*/
BEG_G {
node_t n = isNode($,ARGV[0]);
node_t nxt;
edge_t e;
double d, totd = 0;
if (n == NULL) {
printf(2, "no node named \"%s\"\n", ARGV[0]);
exit(1);
}
while (n.prev != "") {
nxt = isNode($,n.prev);
/* printf(2, "nxt \"%s\"\n", nxt.name); */
e = isEdge (n, nxt, "");
if (e == NULL) {
printf(2, "no edge between %s and %s\n", n.name, nxt.name);
}
e.color = "blue";
/* printf(2, "len %s\n", e.len); */
/* sscanf (e.len, "%f", &d); */
/* totd += d; */
n = nxt;
}
}