it's a graphical implementation for prim's algorithm , <!-- Download Links -->
<!-- Add the rest of your HTML here -->
Introduction
prim's algorithm is an algorithm to calculate the shotest route simply , if we hace alot of nodes called A,B,C,D,.... and every node has links to other each link has a cost. if we wanna calculate the best way to go to have less cost. we implement this algorithm: choose any node randomly,say A and get the minimum link for it,for example this link to C. then we have nodes A,C and try to find the least cost link for both and so on. this application has two classes node and link. how to use the program simply type any name in the name textbox then press a click on the screen and so on to insert nodes as u like then choose from the combo boxes any two nodes,and type the distance. then press insert link button. if u wanna modify the drag using drag and drop. just check the modify check box and drag the graph. has a nice time.......