|
Member 11760977 wrote: but I can not understand
this C# code:
You'll have to give us a specific question if we're going to help you.
The difficult we do right away...
...the impossible takes slightly longer.
|
|
|
|
|
Member 11760977 wrote: but I can not understand this C# code:
Why don't you let the code show you how it works ?
Use the debugger ! You will see the code doing its stuff. Run the code step by step and inspect variables.
Patrice
“Everything should be made as simple as possible, but no simpler.” Albert Einstein
|
|
|
|
|
|
Why do you give me this link ?
I know how it works !
My previous message was giving a way to see the program doing its stuff.
Patrice
“Everything should be made as simple as possible, but no simpler.” Albert Einstein
|
|
|
|
|
Quisiera saber quien tiene el algoritmo de Ford y Fulkerson , he estado buscando en varias paginas este algoritmo, pero no logro conseguir.Si alguien lo puede conseguir lo antes posible o hacerlo estaría muy agradecido.
|
|
|
|
|
This is an English language site. You'll get few responses for postings in other languages.
Bing Translator:
I would like to know who has the algorithm of Ford and Fulkerson, I've been searching several pages this algorithm, but I can not get. If someone can obtain as soon as possible or make it I would be very grateful.
Ford--Fulkerson_algorithm[^] on Wikipedia has an explanation as well as a Python implementation. For other languages, you're on your own...
(This "smells" a bit like homework. If so, you really need to do it yourself!)
"Fairy tales do not tell children the dragons exist. Children already know that dragons exist. Fairy tales tell children the dragons can be killed."
- G.K. Chesterton
|
|
|
|
|
This is still an English language site, and the answers haven't changed since last Thursday[^].
"These people looked deep within my soul and assigned me a number based on the order in which I joined."
- Homer
|
|
|
|
|
A directed graph is called a unique-path graph if given vertices v and w, there is at most one path from v to w. Now, I am given a graph G in which there exists a vertex x that has paths to all other vertices. (The vertex x is not known to us initially) How do I check that G is a unique path graph in O(|E| + |V|) time?
Using the concept of strongly connected components, I can find the vertex x in O(|E|+|V|) time. How do I proceed after that? How does x help us in checking multiple paths between a pair of vertices?
|
|
|
|
|
What data do you have about the graph ? got a example ?
Have you tried something ?
Patrice
“Everything should be made as simple as possible, but no simpler.” Albert Einstein
|
|
|
|
|
Hi All,
I am trying to come up with an algorithm to get following three piece of information to plot a chart:
1. Start : Should be close to the minimum value of the dataset
2. Stop : Should be close to the maximum value of the dataset
3. Interval : Should be such that it will have "0" on the axis when interval traverses from minimum to maximum.
Example: dataset{-266,-17.6,0.5,2000,6000}
My final return values should be:
Start: 400
Stop: 6000
Interval:200
Note: Since start is 400 and interval is 200, we will have 0 as a point on the x-axis.
|
|
|
|
|
How did you choose 400 to be 'close' to -266? Plotting the values from 400 to 6000 in intervals of 200 is a simple straight line. Your question is not clear.
|
|
|
|
|
400 value is in example. I came up with those numbers to explain what I am trying to achieve.
Actually, I did figure this out.
Thanks.
|
|
|
|
|
Hi all!
when this impulse based equation can equal to zero:
w'=w+(j/I)*r*n;
n normal contact;j impulse;I inertia;
modified 1-Sep-15 19:43pm.
|
|
|
|
|
What is your question ?
And I guess more details will be welcomed.
Patrice
“Everything should be made as simple as possible, but no simpler.” Albert Einstein
|
|
|
|
|
as you know: https://en.wikipedia.org/wiki/Collision_response[^]
just that w will never be zero, and need always two points of contact to be;(the eqation above is elastic collision with rotation no friction)!
__________ \/__________
a triangle can never stand like this!(in a real world or can it!?)
see here(http://i.stack.imgur.com/o9P7V.png[^]
what if the ball was heading the center of the bar, the bar won't spin right!
but we know that a force in a direction in a center of mass mmake angular velocity zero right!
but this equation from wiki never make it until there is two points of contact, is that is!?
modified 2-Sep-15 8:34am.
|
|
|
|
|
Ok, the wording is not obvious for not English native people.
A couple of sentences explaining what you are looking for will not arm.
Patrice
“Everything should be made as simple as possible, but no simpler.” Albert Einstein
|
|
|
|
|
|
Good day,
I have a DB, that have a 3000 strings and 40 integer columns, each of them describe something about 1 piece of product, for example, cost, resource, etc.
User type end sum for each column.
I need a feedback, what stack of 5 types of instruments fits max by each column to the user number.
For example, 7 hammers, 2 presses, 3 crowbar, 4 gloves, 5 glasses all together cost 154000 money, user input 150000, have a resource of 923000 hours, user input 920000 etc.
I don't know, how to google that question or use search for it, but if you can help me with it's name or, more of it, with building, i will release my end program under Open Source. Thank you very much for your time, sorry, if my English bad.
|
|
|
|
|
Knapsack problem? Bin packing?
|
|
|
|
|
It is looking like HomeWork !
I think some details are missing in the problem to fully understand what is the request?
It look like a simple counting problem.
What have you tried ? What is your problem ?
Patrice
“Everything should be made as simple as possible, but no simpler.” Albert Einstein
|
|
|
|
|
Good day,
You can solve this problem by integer linear programming.![Rose | [Rose]](https://www.codeproject.com/script/Forums/Images/rose.gif)
|
|
|
|
|
It is more like counting things.
like making a list of all names, and counting each you see a name
and printing the top 5 names.
Patrice
“Everything should be made as simple as possible, but no simpler.” Albert Einstein
|
|
|
|
|
What have you tried so far in solving this?
"I've seen more information on a frickin' sticky note!" - Dave Kreskowiak
|
|
|
|
|
Consider a warehouse with a number of shelves(Bins) that have number, length, width, height and limit Weight capacity.
The Items that place in this warehouse are a number of cubes that have number, length, width, height and weight.
The algorithm must find the right place for Items so Bins have the lowest waste of space. and sum of weight of Items in each bin must not be more than its weight capacity.
Items are placed at the edge of Bins. Namely, any Items can't be placed on Items, behind Items and in front of Items.
____________
I tried to write my problem as an integer linear programming model.
I can't Upload Image Of My Linear Model So I Insert This Link: Here Is the link
[Click Here]
______________
I tried this algorithm:
1_ Sort list of bins Smallest To Biggest.
2_ Sort list of items Biggest To Smallest.
3_ insert each item in first bin that have free space, by best fit algorithm.
It worked but can't swap bins when it's necessary. In other words it is not an optimized algorithm.
please help me 
modified 19-Aug-15 5:34am.
|
|
|
|
|
Please don't repost the same message if it doesn't appear immediately.
All three of your posts went to moderation, and required a human to decide if they were or were not spam.
I have deleted the "spares".
Bad command or file name. Bad, bad command! Sit! Stay! Staaaay...
|
|
|
|
General 
News 
Suggestion 
Question 
Bug 
Answer 
Joke 
Praise 
Rant 
Admin 
Submit an article or tip
