我有两组病媒,即A组和B组。 我有自己的方法测量任何两种病媒之间的距离。 目标是在B组中向该病媒绘制A的矢量图,其距离在具体门槛值之内。 现在,如果两个病媒之间的距离不在某一门槛值之内,那么这些病媒就没有搭配。 制图是一环,即A组中的一种病媒只能被绘制成B组和反射中的一种病媒。
因此,最后可能发生的情况是,A组中的40个病媒被测绘为B组中的40个病媒,因此,A组中的60个病媒与B组中的任何病媒没有配对。
现在,如果我把A1、A2、A3 ......A100和B1、B2、B3 中的病媒贴上标签,那么,通过两套设备进行这种搭配的最有效方式是什么。
请让我知道,是否需要进一步澄清。
What you need to do is first see which vectors from A can be paired with which vectors in B. This is done with O(n^2) complexity and will create a bipartite graph - you have two partitions of vertices - the vectors in A and the vectors in B and you have an edge if and only if a vector from A can be paired with a vector from B. After you have built the graph, you need to find maximum bipartite matching and this is usually done using a flow. Take a look here for instance. I personally use Dinitz algorithm for the flow.
希望这一帮助。
If I have an algorithm which is comprised of (let s say) three sub-algorithms, all with different O() characteristics, e.g.: algorithm A: O(n) algorithm B: O(log(n)) algorithm C: O(n log(n)) How do ...
I m using Electro in Lua for some 3D simulations, and I m running in to something of a mathematical/algorithmic/physics snag. I m trying to figure out how I would find the "spin" of a sphere of a ...
There s a (relatively) new sort on the block called Timsort. It s been used as Python s list.sort, and is now going to be the new Array.sort in Java 7. There s some documentation and a tiny Wikipedia ...
As a learning experience I recently tried implementing Quicksort with 3 way partitioning in C#. Apart from needing to add an extra range check on the left/right variables before the recursive call, ...
Given a 10 digit Telephone Number, we have to print all possible strings created from that. The mapping of the numbers is the one as exactly on a phone s keypad. i.e. for 1,0-> No Letter for 2->...
I have a directed graph and my problem is to enumerate all the minimal (cycles that cannot be constructed as the union of other cycles) directed cycles of this graph. This is different from what the ...
Given an array of integers arr = [5, 6, 1]. When we construct a BST with this input in the same order, we will have "5" as root, "6" as the right child and "1" as left child. Now if our input is ...
I was trying to speed up a certain routine in an application, and my profiler, AQTime, identified one method in particular as a bottleneck. The method has been with us for years, and is part of a "...
