Welcome
"What the heck is this?"This is the place where I can put all the algos I had experience using. Everything you can ever find here will be mostly about using algorithm. Except all materials presented will be geared towards making a programmer to understand concepts - not copy and paste :D
If you are a programmer, willing to learn, and not one of those rotten copy-paster, I am sure you'll find the articles here quite informative, if not valueable. Mathematic is beautiful - without the symbols. If you agree with this then you probably know what I meant. Unlike the time of Netwon, where mathematics are described using both natural language and essay, now we have all these compact symbols all over our text books. Throw in a clueless teacher into the picture and we get a learning disaster. It is most unfortunate, for that is the case for most of us. So? Rather than slapping you with fancy equation, I take effort in wording the concepts.
Oct 25 2007, 21:56 PM
Posted by John
Prim's algorithm is another kind of a greedy algorithm, just like dijkstra's shortest path algorithm. However the difference is Prim's algorithm is to find a minimum spanning tree, not the least path taken as in dijkstra's. A minimum spanning tree is a tree having branches that are as short as possible. When all the branches are measured and summed it must be the smallest value possible.
Oct 18 2007, 11:18 AM
Posted by John
The algorithm will be much easier to understand when we see it in action. Here is an applet demonstrating dijkstra's algorithm process when roaming a network. In this demonstration, our search begin at node g and ends only after all node has been visited. Try clicking and keep clicking the applet to conduct step-by-step search. You will notice nodes and paths changing colors.
Oct 18 2007, 08:39 AM
Posted by John
This is a page mainly for demonstrating the box filtering algorithm using Java applet, make sure your browser is Java capable and enabled. If you are interested in reading the article for box filtering visit this link and see for yourself. Otherwise just play around with the applet below.
Oct 13 2007, 04:57 AM
Posted by John
Before anything else examine the circles below. What is the characteristic?
Oct 10 2007, 23:01 PM
Posted by John
The Bresenham algorithm is probably the most efficient of all line drawing algorithm. It greatly simplifies line drawing by using only integer variables, and importantly removing that costly division operation for slope. Before we begin impementing the algorithm, it is advisable to revise the method for drawing line in an inefficient way. This can help lay out the fundamentals of line algorithm, and is very useful since bresenham algorithm itself is an extension of the inefficient one anyway. The figure below, is circle showing eight octants of region and in the second region lies a line (x,y,x2,y2). The following java code is the logic for drawing line just in that region.