Based on the given function, to find the minimum value in a graph coloring algorithm where the minimum value is greater than one, you can modify your approach to focus on finding the smallest degree (number of edges connected to a vertex) that is greater than one.
I am assuming that taud is the adjecency matrix and sir is the weights matrix.
Following is a modification to the function you gave:
function [derajat, derajatmax, dremax1, dremax, maxdegsir, outmagdegsir, m, n, idx_maxsir, taud, derajatmin] = alokasigraph(taud, sir)
derajat = sum(taud);
derajatmax = max(max(derajat));
dremax1 = find(derajat == derajatmax);
dremax = dremax1(1,1);
% Find the minimum degree greater than one
derajat_filtered = derajat(derajat > 1);
if isempty(derajat_filtered)
derajatmin = NaN; % No degree greater than one found
else
derajatmin = min(derajat_filtered);
end
% Continue with the existing logic
maxdegsir = sir;
outmagdegsir = max(max(maxdegsir(:, dremax), [], 'all'));
[m, n] = find(maxdegsir == outmagdegsir);
idx_maxsir = [m(1), n(1)];
maxdegsir(m(1), :) = 0;
maxdegsir(:, n(1)) = 0;
taud(m(1), :) = 0;
taud(:, n(1)) = 0;
end
I Hope this helps!
