Take a look at http://srufaculty.sru.edu/david.dailey/svg/graphs30.svg
It works in IE, Opera 9 and FF1.5. Nodes of a graph move around and connectivity of the network changes based on broadcast radius of nodes. Alternatively, one can go into "normal" mode and add nodes or change connections, as in a standard static graph. There is some fun math associated with these, should such be of interest: I define the class of graphs thusly constructable (in which nodes are connected iff their distance is less than some threshold R) in Euclidean n-space as n-Euclidean. The n-Euclidean size of the simple star (bipartite graph K1,m) is equivalent to the sphere-packing problem, implying that for each n there is a graph that is n-Euclidean but not n-1 Euclidean. A friend recently proved that every graph on n nodes is n-Euclidean. I've seen some work on similar things investigating connectivity of graphs embedded on the torus. cheers, David ----- To unsubscribe send a message to: [EMAIL PROTECTED] -or- visit http://groups.yahoo.com/group/svg-developers and click "edit my membership" ---- Yahoo! Groups Links <*> To visit your group on the web, go to: http://groups.yahoo.com/group/svg-developers/ <*> Your email settings: Individual Email | Traditional <*> To change settings online go to: http://groups.yahoo.com/group/svg-developers/join (Yahoo! ID required) <*> To change settings via email: mailto:[EMAIL PROTECTED] mailto:[EMAIL PROTECTED] <*> To unsubscribe from this group, send an email to: [EMAIL PROTECTED] <*> Your use of Yahoo! Groups is subject to: http://docs.yahoo.com/info/terms/
