Write a C program,
compare f1 f2 f3 ...
f1, f2, f3, ...
, as
[command line]
parameters.
Each file contains C-code which has been preprocessed, as in
[prac#3].
Your program must calculate a weighted [graph], in which there is a vertex for each of the given files. Implement the graph by an adjacency matrix.
You may use this
[LCS routine]
if you wish. |
The weight of the edge between fi and fj
is defined to be
Your program must print the adjacency matrix.
NB. [Prac#5]
involves modifying your program.
You may use this
[BM routine]
if you wish. |
The weight of the edge between fi and fj
is defined to be
Your program must print the adjacency matrix.
NB. [Prac#5]
involves modifying your program.
It is important to divide the various sub-tasks (e.g. read a file, compute w( ), etc.) into subroutines in a sensible way.
You may assume that
maxLen
' characters,
maxFile
' files, and
You cannot assume that as many as maxFile
files
can be open simultaneously.