Hi there, I am a newbie to Wt library and want to implement a web portal similar to the following one: http://www.eh3.uc.edu:8080/GenomicsPortals/
As I am a big boost C++ fan, I know that Boost.Graph library provide good algorithms for finding the shortest path for this problem: ----------------------- Let G be the undirected graph given by the following adjacency list: 0 -> 2, 3 1 -> 2, 4 2 -> 3, 4 3 -> 1 4 -> 3 5 -> 0 6 -> 7 7 -> 8, 9 9 -> 10 Using, say, a breadth first search, for any two random nodes in the graph print the shortest path between them. For example, the shortest path between 5 and 3 is: 5 -> 0 -> 3 ----------------------- The boost.Graphi solution is as follows: http://www.boost.org/doc/libs/1_40_0/libs/graph/doc/kevin_bacon.html Do I get this right: I CAN use Wt library to design a web portal similar to the one of the first link and let its server controls on the web portal call Boost.Graph algorithm of the 2nd link to calculate the shortest path, and display the result in the web portal ? If somebody can outline some detailed steps I should go through to design such a web portal with the said algorithm, that would be highly appreciated. Thanks a lot in advance, Robert ------------------------------------------------------------------------------ Come build with us! The BlackBerry(R) Developer Conference in SF, CA is the only developer event you need to attend this year. Jumpstart your developing skills, take BlackBerry mobile applications to market and stay ahead of the curve. Join us from November 9 - 12, 2009. Register now! http://p.sf.net/sfu/devconference _______________________________________________ witty-interest mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/witty-interest
