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 DEBIAN
ldns_buffer_current
ldns(3) Library Functions Manual ldns(3)
NAME
ldns_buffer_limit, ldns_buffer_set_limit, ldns_buffer_capacity, ldns_buffer_set_capacity, ldns_buffer_reserve, ldns_buffer_at, ldns_buf-
fer_begin, ldns_buffer_end, ldns_buffer_current-
SYNOPSIS
#include <stdint.h>
#include <stdbool.h>
#include <ldns/ldns.h>
size_t ldns_buffer_limit(ldns_buffer *buffer);
void ldns_buffer_set_limit(ldns_buffer *buffer, size_t limit);
size_t ldns_buffer_capacity(ldns_buffer *buffer);
bool ldns_buffer_set_capacity(ldns_buffer *buffer, size_t capacity);
bool ldns_buffer_reserve(ldns_buffer *buffer, size_t amount);
uint8_t * ldns_buffer_at(const ldns_buffer *buffer, size_t at);
uint8_t * ldns_buffer_begin(const ldns_buffer *buffer);
uint8_t * ldns_buffer_end(ldns_buffer *buffer);
uint8_t * ldns_buffer_current(ldns_buffer *buffer);
DESCRIPTION
ldns_buffer_limit() returns the maximum size of the buffer param[in] buffer
Returns the size
ldns_buffer_set_limit() changes the buffer's limit. If the buffer's position is greater than the new limit the position is set to the
limit.
buffer: the buffer
limit: the new limit
ldns_buffer_capacity() returns the number of bytes the buffer can hold.
buffer: the buffer
Returns the number of bytes
ldns_buffer_set_capacity() changes the buffer's capacity. The data is reallocated so any pointers to the data may become invalid. The
buffer's limit is set to the buffer's new capacity.
buffer: the buffer
capacity: the capacity to use
Returns whether this failed or succeeded
ldns_buffer_reserve() ensures BUFFER can contain at least AMOUNT more bytes. The buffer's capacity is increased if necessary using buf-
fer_set_capacity().
The buffer's limit is always set to the (possibly increased) capacity.
buffer: the buffer
amount: amount to use
Returns whether this failed or succeeded
ldns_buffer_at() returns a pointer to the data at the indicated position.
buffer: the buffer
at: position
Returns the pointer to the data
ldns_buffer_begin() returns a pointer to the beginning of the buffer (the data at position 0).
buffer: the buffer
Returns the pointer
ldns_buffer_end() returns a pointer to the end of the buffer (the data at the buffer's limit).
buffer: the buffer
Returns the pointer
ldns_buffer_current() returns a pointer to the data at the buffer's current position.
buffer: the buffer
Returns the pointer
AUTHOR
The ldns team at NLnet Labs. Which consists out of Jelte Jansen and Miek Gieben.
REPORTING BUGS
Please report bugs to ldns-team@nlnetlabs.nl or in our bugzilla at http://www.nlnetlabs.nl/bugs/index.html
COPYRIGHT
Copyright (c) 2004 - 2006 NLnet Labs.
Licensed under the BSD License. There is NO warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
SEE ALSO
ldns_buffer. And perldoc Net::DNS, RFC1034, RFC1035, RFC4033, RFC4034 and RFC4035.
REMARKS
This manpage was automaticly generated from the ldns source code by use of Doxygen and some perl.
30 May 2006 ldns(3)