thanks Simon , for yourattention , yes , one of the way to Clustering in k-medoids , is using euclidean distance between turtles or data points . but Almost I'm new in NetLogo . Thanks in Advance for Any Help .
-- You received this message because you are subscribed to the Google Groups "netlogo-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. For more options, visit https://groups.google.com/d/optout.
