I have a (large) graph in which the Node attributes are 3d coordinates. For Nodes A and B, the edge weighting I want to use is a function of the slope (i.e. Z coord difference) between A and B.
Is it possible to achieve this without having to create a directed graph (I'd rather not have to double-up on the edges if I can avoid it)? i.e., for an undirected graph, does the underlying traversal mechanism pass distinct edges E1 = (A,B) and E2 = (B,A) to the EdgeWeighter or is (say) E1 passed in either case? Thanks, Jerry. This message has been checked for viruses but the contents of an attachment may still contain software viruses, which could damage your computer system: you are advised to perform your own checks. Email communications with the University of Nottingham may be monitored as permitted by UK legislation. ------------------------------------------------------------------------- This SF.net email is sponsored by the 2008 JavaOne(SM) Conference Don't miss this year's exciting event. There's still time to save $100. Use priority code J8TL2D2. http://ad.doubleclick.net/clk;198757673;13503038;p?http://java.sun.com/javaone _______________________________________________ Geotools-gt2-users mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/geotools-gt2-users
