It's bagyo in here.
You can check out Bagyong Ondoy photos to see it yourself.
Saturday, September 26, 2009
Friday, September 25, 2009
A star for routing
A* can be used for routing as I've seen in many cases such as Erin Andrews peephole and the wonderful Grey's Anatomy S06E01 streaming.
I want to try it now. :(
I want to try it now. :(
Thursday, September 17, 2009
Networks
Pwedeng imodel ang networks thru graphs.
Oo. At dahil doon, pwede rin iapply ang graph algorithms sa networks. Yung mga dijkstra, prim at iba pa. Bakit small letter? Wala lang.
Practical example niyan ay pagsend ng signal from US to Pinas para mapanood ng Mayweather vs Marquez Live Stream. Shortest-path ata ang ginagamit eh.
Oo. At dahil doon, pwede rin iapply ang graph algorithms sa networks. Yung mga dijkstra, prim at iba pa. Bakit small letter? Wala lang.
Practical example niyan ay pagsend ng signal from US to Pinas para mapanood ng Mayweather vs Marquez Live Stream. Shortest-path ata ang ginagamit eh.
Shortest path first algo will rule the world
Yes.
I firmly believe in my ideology that shortest path first algorithms will rule the world before 2020.
My claim can be supported by the algorithm's imporantanteity in this world. Hahaha. It's so like tanga na. LMAO.
I firmly believe in my ideology that shortest path first algorithms will rule the world before 2020.
My claim can be supported by the algorithm's imporantanteity in this world. Hahaha. It's so like tanga na. LMAO.
Sunday, September 6, 2009
Graphs
Graphs.
In Computer Science, graphs are like networks or other sort of things. Not a graphical representation of some data. :D
Graphs are composed of vertices and edges. One of the most common metaphor for vertices are cities while edges are the roads leading to these cities.
There are a lot of graph algorithms such as Breadth-First Search, Depth-First Search, Dijkstra, Prim's algorithm, Floyd-Warshall, Kruskal and many more.
As of now, I can implement BFS, DFS, Dijkstra, Prim and Floyd-Warshall. I still don't know bipartite matching. LOL.
In Computer Science, graphs are like networks or other sort of things. Not a graphical representation of some data. :D
Graphs are composed of vertices and edges. One of the most common metaphor for vertices are cities while edges are the roads leading to these cities.
There are a lot of graph algorithms such as Breadth-First Search, Depth-First Search, Dijkstra, Prim's algorithm, Floyd-Warshall, Kruskal and many more.
As of now, I can implement BFS, DFS, Dijkstra, Prim and Floyd-Warshall. I still don't know bipartite matching. LOL.
Subscribe to:
Posts (Atom)