Skip to content

Instantly share code, notes, and snippets.

View jindig's full-sized avatar

Josh Indig jindig

View GitHub Profile
@ndarville
ndarville / business-models.md
Last active January 13, 2024 17:27
Business models based on the compiled list at http://news.ycombinator.com/item?id=4924647. I find the link very hard to browse, so I made a simple version in Markdown instead.

Business Models

Advertising

Models Examples
Display ads Yahoo!
Search ads Google
@soundsmitten
soundsmitten / floyd.java
Created December 12, 2012 23:07
Java- Floyd's algorithm
// Wikipedia: a graph analysis algorithm for finding shortest paths in a weighted graph
// (with positive or negative edge weights) and also for finding transitive closure of a
// relation R. A single execution of the algorithm will find the lengths (summed weights)
// of the shortest paths between all pairs of vertices, though it does not return details
// of the paths themselves. The algorithm is an example of dynamic programming.
public void floyd(int n, int[][] W, int[][] P, int[][] D)
{
D = W;
for (int i = 0; i<n; i++)