In [1]:

    

function my_deferred_acceptance_2(prop_prefs, resp_prefs, caps)
    prop_size = size(prop_prefs, 2) #prop主体数
    resp_size = size(resp_prefs, 2) #pref主体数
    prop_matched = zeros(Int64, prop_size) #propマッチ相手配列の初期化
    resp_matched = zeros(Int64, sum(caps)) #resfマッチ相手配列の初期化
    next_prop = zeros(Int64, prop_size) #propが次にプロポーズをする時の回数
    max_prop = Int64[] #最大プロポーズ回数配列の初期化
    
    for p in 1:prop_size
        push!(max_prop, find(prop_prefs[:, p] .== 0)[1]-1) #最大プロポーズ回数配列の設定
    end
    
    indptr = Array{Int}(resp_size+1)
    indptr[1] = 1
    for i in 1:resp_size
        indptr[i+1] = indptr[i] + caps[i]
    end
    
    while any(prop_matched .== 0) == true
        prop_single = find(prop_matched .== 0) #マッチしてない学生一覧
        if all(next_prop[prop_single] .>= max_prop[prop_single]) == true #全員が最大プロポーズ回数をこえていればbreak
            break
        else
            for each_prop_single in prop_single
                proposing = prop_prefs[next_prop[each_prop_single]+1, each_prop_single] #次にプロポーズする相手
                if proposing != 0
                    next_prop[each_prop_single] = next_prop[each_prop_single]+1
                    if sum(resp_matched[indptr[proposing]:indptr[proposing+1]-1] .== 0) != 0 && (find(resp_prefs[:, proposing] .==each_prop_single) .<  find(resp_prefs[:, proposing] .==0)) == [true]
                        prop_matched[each_prop_single] = proposing
                        matched_index = findfirst(resp_matched[indptr[proposing]:indptr[proposing+1]-1] .== 0)
                        resp_matched[matched_index + indptr[proposing] - 1] = each_prop_single
                    elseif sum(resp_matched[indptr[proposing]:indptr[proposing+1]-1] .== 0) .== 0 #respに0の枠あり
                        current_order = Int64[]
                        for i in 1:caps[proposing] push!(current_order, find(resp_prefs[:, proposing] .== resp_matched[indptr[proposing]+i-1])[1]) end
                        if all(findmax(current_order)[1] .> find(resp_prefs[:, proposing] .== each_prop_single)) == true
                        prop_matched[each_prop_single] = proposing
                        prop_matched[resp_matched[findmax(current_order)[2] + indptr[proposing] - 1]] = 0
                        resp_matched[findmax(current_order)[2] + indptr[proposing] - 1] = each_prop_single
                        end
                    end
                end
            end
        end
    end
       
    return prop_matched, resp_matched, indptr
end


    

    
Out[1]:





my_deferred_acceptance_2 (generic function with 1 method)

In [2]:

    

using MyMatching


    

In [3]:

    

prop_prefs = 
[3  3  2  3;
 0  0  1  2;
 1  2  0  0;
 2  1  3  1]


    

    
Out[3]:





4×4 Array{Int64,2}:
 3  3  2  3
 0  0  1  2
 1  2  0  0
 2  1  3  1

In [4]:

    

resp_prefs = 
[ 3  3  3;
 4  4  4;
 0  2  2;
 2  1  0;
 1  0  1]


    

    
Out[4]:





5×3 Array{Int64,2}:
 3  3  3
 4  4  4
 0  2  2
 2  1  0
 1  0  1

In [5]:

    

caps = [2,2,2];


    

In [6]:

    

my_deferred_acceptance_2(prop_prefs, resp_prefs, caps)


    

    
Out[6]:





([0, 3, 2, 3], [0, 0, 3, 0, 2, 4], [1, 3, 5, 7])

In [7]:

    

my_deferred_acceptance(prop_prefs, resp_prefs, caps)


    

    
Out[7]:





([0, 3, 2, 3], [0, 0, 3, 0, 2, 4], [1, 3, 5, 7])

In [8]:

    

prop_prefs = [[2], [2, 1], [2, 1], [1, 2, 3, 4], [2, 1, 4, 3], [2, 3, 1, 4], [2, 1, 4, 3], [4, 2, 1, 3]]
resp_prefs = [[3, 7], [7, 8, 5, 1, 2, 3, 4, 6], [2, 5, 8, 1, 3, 4, 7], [2, 5, 1, 3, 6, 4, 7]]
caps = [2, 2, 2, 2];


    

In [9]:

    

prop_prefs_2d = Array{Int64}(length(resp_prefs)+1, length(prop_prefs))    
for i in 1:length(prop_prefs)
        if length(prop_prefs[i]) != length(resp_prefs)
            x = vcat(prop_prefs[i], 0)
            x = vcat(x, setdiff([i for i in 1:length(resp_prefs)], prop_prefs[i]))
            prop_prefs_2d[:,i] = x
        else
            prop_prefs_2d[:,i] = vcat(prop_prefs[i], 0)
        end
    end
    resp_prefs_2d = Array{Int64}(length(prop_prefs)+1, length(resp_prefs))
    for i in 1:length(resp_prefs)
        if length(resp_prefs[i]) != length(prop_prefs)
            x = vcat(resp_prefs[i], 0)
            x = vcat(x, setdiff([i for i in 1:length(prop_prefs)], resp_prefs[i]))
            resp_prefs_2d[:,i] = x
        else
            resp_prefs_2d[:,i] = vcat(resp_prefs[i], 0)
        end
    end


    

In [12]:

    

my_deferred_acceptance(prop_prefs, resp_prefs, caps)


    

    
Out[12]:





([0, 0, 1, 3, 4, 4, 2, 2], [3, 0, 7, 8, 4, 0, 5, 6], [1, 3, 5, 7, 9])

In [13]:

    

my_deferred_acceptance(prop_prefs_2d, resp_prefs_2d, caps)


    

    
Out[13]:





([0, 0, 1, 3, 4, 4, 2, 2], [3, 0, 7, 8, 4, 0, 5, 6], [1, 3, 5, 7, 9])

In [14]:

    

my_deferred_acceptance(prop_prefs, resp_prefs, [1,1,1,1])


    

    
Out[14]:





([0, 0, 1, 0, 4, 0, 2, 3], [3, 7, 8, 5], [1, 2, 3, 4, 5])

In [15]:

    

my_deferred_acceptance(prop_prefs_2d, resp_prefs_2d, [1,1,1,1])


    

    
Out[15]:





([0, 0, 1, 0, 4, 0, 2, 3], [3, 7, 8, 5], [1, 2, 3, 4, 5])

In [18]:

    

caps = [1,1]


    

    
Out[18]:





2-element Array{Int64,1}:
 1
 1

In [ ]:

    




    

In [10]:

    

my_deferred_acceptance(prop_prefs, resp_prefs, caps)


    

    




UndefVarError: next_prop not defined

Stacktrace:
 [1] my_deferred_acceptance(::Array{Int64,2}, ::Array{Int64,2}, ::Array{Int64,1}) at C:\Users\Taneaki.Taneaki-PC\.julia\v0.6\MyMatching\src\deferred_acceptance.jl:20
 [2] my_deferred_acceptance(::Array{Array{Int64,1},1}, ::Array{Array{Int64,1},1}, ::Array{Int64,1}) at C:\Users\Taneaki.Taneaki-PC\.julia\v0.6\MyMatching\src\deferred_acceptance.jl:69

In [ ]:

    

my_deferred_acceptance(prop_prefs, resp_prefs, caps)


    

In [24]:

    

m_prefs = f_prefs = [1 2 ; 2 1 ; 0 0]


    

    
Out[24]:





3×2 Array{Int64,2}:
 1  2
 2  1
 0  0

In [37]:

    

my_deferred_acceptance_2(prop_prefs_2d, resp_prefs_2d, caps)


    

    
Out[37]:





([0, 0, 1, 3, 4, 4, 2, 2], [3, 0, 7, 8, 4, 0, 5, 6], [1, 3, 5, 7, 9])

In [ ]: