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.
Sunday, September 6, 2009
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment