> Vertex set 1: Buildings That's wrong. We want matchings. Vertex set 1: offered Jobs
> Vertex set 2: globs > Edge per resource: exists if glob has correct or no resource type, and can > do the job before starving. > Weight of Edge: distance + priority ? > (small priority number = highest priority) > or distance * priority, or sqrt(distance) * priorty ? I guess we need the maximizing version of the algorithm instead. Maybe we don't need to implement it on our own: http://www.koders.com/default.aspx?s=hungarian+algorithm&btn=Search&la=Cpp&li=* -- Kai Antweiler _______________________________________________ glob2-devel mailing list [email protected] http://lists.nongnu.org/mailman/listinfo/glob2-devel
