11-30-2011
A minute and will post an input file and the correct source code if the problem is clear for you. Normal Dijkstra gives you the shortest path between any two nodes in terms of let's say loss rate. Basicly, it shows you how you can transfer data between two nodes with less delay (you can add delay between nodes 1, 5, 6, and 2 (see e.g., in first post) to be the total; so the current code shows you between any two nodes in your network where is the path with minimum delay). BUT I want to adjust this to give me the best path in terms of capacity (since capacity is not addiditve quantity (it's limited by the minimum capacity on that path; you can't add capacities between nodes 1, 5, 6, and 2 and say Dijkstra will give minimum capacity as in delay; It's the opposite in here since we need capacity to be the larger, but of course limited by the minimum capacity between 1 and 5, which is 3). Therefore, I need Dijkstra to tell me what is the best path that has minimum capacity grater than others as mentioned in my previous post.
---------- Post updated at 03:06 PM ---------- Previous update was at 02:49 PM ----------
No it's not a HW problem; it's related to an experiment I'm doing.
9 More Discussions You Might Find Interesting
1. Programming
Hi
I search an exemple of scheduling Feedback algorithm, or help about how to create one.
Thanks (0 Replies)
Discussion started by: messier79
0 Replies
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 ...... (1 Reply)
Discussion started by: bourne
1 Replies
3. Shell Programming and Scripting
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)
Discussion started by: filthymonk
5 Replies
4. UNIX for Advanced & Expert Users
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)
Discussion started by: delsega
1 Replies
5. Programming
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)
Discussion started by: solaris_user
0 Replies
6. Homework & Coursework Questions
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)
Discussion started by: sureshcisco
1 Replies
7. UNIX for Dummies Questions & Answers
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)
Discussion started by: syah
1 Replies
8. Homework & Coursework Questions
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)
Discussion started by: syah
4 Replies
9. Shell Programming and Scripting
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)
Discussion started by: n78298
5 Replies
LEARN ABOUT OPENSOLARIS
di_path_phci_next_path
di_path_client_next_path(3DEVINFO) Device Information Library Functions di_path_client_next_path(3DEVINFO)
NAME
di_path_client_next_path, di_path_phci_next_path - libdevinfo path node traversal functions
SYNOPSIS
cc [ flag... ] file... -ldevinfo [ library... ]
#include <libdevinfo.h>
di_path_t di_path_client_next_path(di_node_t node node,
di_path_t path);
di_path_t di_path_phci_next_path(di_node_t node node,
di_path_t path);
PARAMETERS
node The handle to a device node in a di_init(3DEVINFO) snapshot. For di_path_client_next_path(), node must be a client device node.
For di_path_phci_next_path(), node must be a pHCI device node.
path DI_PATH_NIL, or the handle to a path node in a snapshot.
DESCRIPTION
Each path node is an element in a pHCI-client matrix. The matrix is implemented by dual linked lists: one list links path nodes related to
a common client head, and the other links path nodes related to a common pHCI head.
The di_path_client_next_path() function is called on a multipathing 'client' device node, where a 'client' is the child of a vHCI device
node, and is associated with a specific endpoint device identity (independent of physical paths). If the path argument is NULL,
di_path_client_next_path() returns the first path node associated with the client. To walk all path nodes associated with a client,
returned di_path_t values are fed back into di_path_client_next_path(), via the path argument, until a null path node is returned. For
each path node, di_path_bus_addr(3DEVINFO) returns the pHCI child path node unit-address.
The di_path_phci_next_path() function is called on a multipathing pHCI device node. If the path argument is NULL, di_path_phci_next_path()
returns the first path node associated with the pHCI. To walk all path nodes associated with a pHCI, returned di_path_t values are fed back
into di_path_phci_next_path(), via the path argument, until a null path node is returned. For each path node, di_path_client_node(3DEV-
INFO) provides a pointer to the associated client device node.
A device node can be a client device node of one multipathing class and a pHCI device node of another class.
RETURN VALUES
Upon successful completion, a handle to the next path node is returned. Otherwise, DI_PATH_NIL is returned and errno is set to indicate the
error.
ERRORS
These functions will fail if:
EINVAL One or more argument was invalid.
ENOTSUP Path node information is not available in the snapshot.
ENXIO The end of the path node list was reached.
ATTRIBUTES
See attributes(5) for descriptions of the following attributes:
+-----------------------------+-----------------------------+
| ATTRIBUTE TYPE | ATTRIBUTE VALUE |
+-----------------------------+-----------------------------+
|Interface Stability |Committed |
+-----------------------------+-----------------------------+
|MT-Level |Safe |
+-----------------------------+-----------------------------+
SEE ALSO
di_init(3DEVINFO), di_path_bus_addr(3DEVINFO), di_path_client_node(3DEVINFO), libdevinfo(3LIB), attributes(5)
Writing Device Drivers
SunOS 5.11 15 May 2008 di_path_client_next_path(3DEVINFO)