Looking for Your Help on dijkstra algorithm Post: 302578052

9 More Discussions You Might Find Interesting

1. Programming

Feedback algorithm

Hi I search an exemple of scheduling Feedback algorithm, or help about how to create one. Thanks

2. Solaris

I am tryin to change the sort fields in mainframes to the equivalent in Unix. I have a large datafile of which i extract only the specified fields ... cut them ... write it into another file with a delimiter... and sort based on these fields... then match these fields to those from input file ......

3. Shell Programming and Scripting

algorithm

PID USERNAME SIZE RSS STATE PRI NICE TIME CPU PROCESS/NLWP 21444 tomusr 213M 61M sleep 29 10 1:20:46 0.1% java/43 21249 root 93M 44M sleep 29 10 1:07:19 0.2% java/56 is there anyway i can use a command to get the total of the SIZE? 306M (Derive from...

4. UNIX for Advanced & Expert Users

Algorithm In Pseudocode

A) produce an algorithm in pseudocode and a flowchart that gets n from the user and calculate their sum. B) Write an algorithm in pseudocode and a flowchart that gets number x from he user and calculates x5 ( X to the power of %5). Calculate by using multiplication. ...

5. Programming

Please help me to develop algorithm

Hi guys , in my study book from which I re-learn C is task to generate all possible characters combination from numbers entered by the user. I know this algorithm must use combinatorics to calculate all permutations. Problem is how to implement algortihm. // This program reads the four numbers...

6. Homework & Coursework Questions

Heuristic Algorithm Example

Give a counter example such that the following heuristic algorithm, for the 2-tape problem, doesn't always produce the best solution: Algorithm: Sort {Xi} in descending order. Place files in tapes one at a time. For a file being considered, assign the file to the smaller tape. Thanks in...

7. UNIX for Dummies Questions & Answers

banker's algorithm.. help

i'm doing banker's algorithm.. got some error there but i cant fix it.. please help!! #!/bin/bash echo "enter no.of resources: " read n1 echo -n "enter the max no .of resources for each type: " for(( i=0; i <$n1; i++ )) do read ${t} done echo -n "enter no .of...

8. Homework & Coursework Questions

Banker's algorithm

Use and complete the template provided. The entire template must be completed. If you don't, your post may be deleted! 1. The problem statement, all variables and given/known data: shell scripts to simulate Banker’s algorithm on a collection of processes (process details are entered as inputs...

9. Shell Programming and Scripting

Masking algorithm

I have a requirement of masking few specific fields in the UNIX file. The details are as following- File is fixed length file with each record of 250 charater length. 2 fields needs to be masked – the positions are 21:30 and 110:120 The character by character making needs to be done which...

LEARN ABOUT SUSE

dijkstra

DIJKSTRA(1)						      General Commands Manual						       DIJKSTRA(1)

NAME

       dijkstra - single-source distance filter

SYNOPSIS

       dijkstra [ -ap?	] [ sourcenode file ]

DESCRIPTION

       dijkstra  reads	a  stream  of  graphs  and  for each computes the distance of every node from sourcenode.  Edge length is given in the len
       attribute, and the default is 1.  The dist attribute of every node is set to its distance from sourcenode.  If the -p  flag  is	used,  the
       prev  attribute	of  each  node	reachable from sourcenode is set to the name of the previous node on a shortest path.  The graph attribute
       maxdist is set to the maximum dist of all nodes in the graph.

       By default, if the graph is disconnected, the dist attribute of nodes unreachable from sourcenode are left untouched, and maxdist is set to
       the  maximum  of  any  previous	value  and  the largest distance recorded in this run. On the other hand, if the -a flag is used, the dist
       attribute of an unreachable node is assigned a very large value, and maxdist records the maximum distance found in the component containing
       sourcenode.

       Any number of sourcenode file pairs may be given.  If the last file is missing, stdin is used.  All output is written to stdout.

       In a typical application, dist and maxdist can drive a downstream calculation of color or some other attribute.

SEE ALSO

       gvpr(1), gvcolor(1), libgraph(3)

								   21 March 2001						       DIJKSTRA(1)