fid = fopen('input_graph.txt');
EDGES = fscanf(fid, '%i -> %i', [2 inf]);
fclose(fid);

sizeRow = size(EDGES, 2);
sizeColumn = size(EDGES, 1);
neighborhoodMatrix = zeros(sizeRow, sizeRow);
maximumNumberInMatrix = max(EDGES(:))

for i = 1:sizeRow
    v1 = EDGES(1,i);
    v2 = EDGES(2,i);
    neighborhoodMatrix(v1, v2) = 1;
end

d = 0.85;

sumFor = sum(neighborhoodMatrix, 2);
sumForDiag = sumFor.^(-1);
sumForDiag(~isfinite(sumForDiag)) = 0;
matrixA = diag(sumForDiag);

matrixE = ones(maximumNumberInMatrix,maximumNumberInMatrix)

M = (d * neighborhoodMatrix * matrixA + (1 - d / maximumNumberInMatrix) * matrixE)