N = size(subClasses('A01'),2);
distances = zeros(size(subClasses('A01'),1), size(subClasses('A23'),1));
scores = ones(size(subClasses('A01'),1), size(subClasses('A23'),1));
for h=1:size(subClasses('A01'),1)
   for j=1:size(subClasses('A23'),1)
       line = zeros(s,N);
       for k=1:N
           %utworzenie prostych
           a01 = subClasses('A01');
           a23 = subClasses('A23');
           x = linspace(a01(h,k),a23(j,k), s);
           line(:,k) = x.';
       end
       t = linspace(0,1, s);
       %obliczenie odległości od punktów na prostej
       switch obj.metric
           case 1
               dist = Manhattan(line,obj.Points(i, :));
           case 2
               dist = Euclid(line,obj.Points(i, :));
           case inf
               dist = Chebyshev(line,obj.Points(i, :));
       end
       %wybór najbliższego punktu
       [M,I] = min(dist);
       distances(h,j) = M;
       scores(h,j) = t(I);
   end
end
%wartość funkcji skoringowej dla najbliższej prostej
[row,col]=find(distances==min(nonzeros(distances)));
value = scores(row(1,1),col(1,1));
%średnia wszystkich wartości funckji skoringowej
%value = sum(scores,'all')/(size(scores,1)*size(scores,2));
ranking(i, :) = [value, obj.Points(i, :)];