basicwalker_mod.m

function [totalcrosstime, dif, wlist, llist]=basicwalker_mod(num_widths, num_lengths, wt, lt, light_time, trials)
% calculates total amount of time waiting at crosslights using a basic
% algorithm where the walker walks all lengths first and then widths
%
% PARAMETERS:
% num_widths = number of width segments in the grid
% num_lengths = number of length segments in the grid
% wt = time to walk a width
% lt = time to walk a length
% light_time = maximum length of a light
    wlist = [];
    llist = [];
    total = num_widths + num_lengths;

lengths = num_lengths;
widths = num_widths;

totalcrosstime = 0;

while (lengths > 0) || (widths > 0)
        llist(total-lengths-widths+1) = lengths;
        wlist(total-lengths-widths+1) = widths;
    % ONLY WIDTHS REMAIN
    if (widths > 0)
        % red light wait
        if rand(1) < .5 
            totalcrosstime = totalcrosstime + rand(1)*light_time;
        end
        widths = widths - 1;
        totalcrosstime = totalcrosstime + wt;
    % ONLY LENGTHS REMAIN
    elseif (widths == 0)
        % red light wait
        if rand(1) < .5 
            totalcrosstime = totalcrosstime + rand(1)*light_time;
        end
        lengths = lengths - 1;
        totalcrosstime = totalcrosstime + lt;
    end
end

% dif = (light_time.*(num_widths + num_lengths))*rand(1);

dif = totalcrosstime - lt.*num_lengths - wt.*num_widths;

end