There are 16 processes, which all consume a certain amount of paint. The goal of the project is to go from 'Start' to 'End', while maximizing the remaining amount of paint. Process 1 (to go from start to A )consumes 3,88 units of paint. As this is an undirected graph, A-D consumes the same amount of paint as D-A.
But before I can apply the dijkstra algorithm, I need to read the following file into an adjacency matrix. The matrix has to be 12x12 (Start, A, B, C, D, ... =12). The first row of the matrix (index 0) has to represent 'start', the second row (index 1) has to represent A, and so on.
For example: As start is connected to A , Matrix[0][1]=-3,88 and Matrix[1][0]=-3,88 (because it is an undirected graph)
As A is connected to D, Matrix[1][5]=-0,43 and Matrix[5][1]=-0,43
Can someone help me to read this file into the adjacency matrix?