Hey Guys, Thanks for posting this.

Could anyone please clarify for me following things? I have just started to learn about startup capital. 1. Since company is now closed down what happens to Investor's money ? Do they just loose all or do owners have to return it ? ( sorry if this seems pretty noob but I would like to know it ) 2. What does 1 year maturity mean in convertible notes ? 3. Shouldn't the Net Operating Income be negative ? Since they had income of $280696 and Expense were $2,665,192.34 ? Did they count investor's money as income ? or how did they arrive at $2,384,224.67 ? Thank you for the reply.

I can answer the first one

> 1. Since company is now closed down what happens to Investor's money ? Do they just loose all or do owners have to return it ?

They lose it. http://en.wikipedia.org/wiki/Venture_capital

Thank you both.

PG has an essay that covers a lot of how this works (2005):

http://paulgraham.com/startupfunding.html

This Techcrunch article is about convertible notes but covers some of this stuff and has some good links in it (2012):

http://techcrunch.com/2012/04/07/convertible-note-seed-finan...

And a more lawyerly perspective (2010):

http://www.saul.com/media/tool/997_PDF_2534.pdf

In a scenario where a company is being shut down and there is still cash in the bank, the remaining funds would be distributed to the investors.

my 2 cents : people will create fake accounts and will use wifi for p2p

Psst, don't tip them off

Just a thought that , could use of Drones for transportation make this problem less useful ?

I admire solution presented here however just saying.

Optimizing the distribution of goods through a network of highways is just one of the, literally, hundreds of applications where this could (and probably will) be useful.

You are very correct. Max-flow/min-cut reduces to tons of other problems where this algorithm will be optimized.

Here's a nice little introduction I found with some reductions on the first couple slides: http://www.cs.princeton.edu/courses/archive/spr04/cos226/lec...

I just finished my algorithms undergrad class last semester; one of the questions on the final was 'you are a terrorist looking to cut off supplies to your enemy, which 3 nodes must you destroy to cut off the supply network?' And there was a complicated graph with probably 10 nodes and twice as many edges (very difficult to brute force in the allotted time), and we had to find the min-cut which would severe the flow. Some really cool problems reduce to max-flow.

Our lecturer told us that the problem was initially considered simultaneously by Russians trying to optimise the rail transport of stuff from USSR back to Russia and Americans trying to work out the cheapest way to destroy that network. Not sure if it's true, but it helps me think about the problem a lot.

Edit: I clicked the link, he used them exact slides. That set of slides comes up a lot, they're great.

You are right! Edmonds-karp was developed (really just a modified Ford-Faulkerson approach with a BFS as opposed to a random augmenting path...but we'll give it to him), yielding an O(ve^2) algorithm. A russian (soviet) mathematician named Dinic nearly simultaneously, and independently, developed an O(ev^2) algorithm which we can see beats Edmonds-karp as edge density grows.

Drones would still have places they're allowed to fly and places they're not. So the solution will probably still apply.