Can you help to adjust the void dijkstra(int s) function to find a path from source to every node so that the minimum cost on that path is maximum.
Ex:
From 1 to 2 we have 1 - 3 - 4 - 2 , costs(2+3+4+5)
From 1 to 2 we have 1 - 5 - 6 - 2 , costs(3+3+4+5)
I need the algorithm to choose path 1 - 5 - 6 - 2 since minimum cost = 3 > minimum cost in the first path.
======= Here is the code I'm looking to adjust ======
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 ...... (1 Reply)
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... (5 Replies)
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.
... (1 Reply)
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... (0 Replies)
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... (1 Reply)
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... (1 Reply)
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... (4 Replies)
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... (5 Replies)