In this project, there is a extended algorithm is explained and
Reading the inputs in text files running this algoritm properly.
Recording the running time for each text file with this algoritm.
These times are printing on the screen.
Using of already prepared methods is not allowed.
(This rule not acceptable for measuring the time.)
- Reading the [url removed, login to view] files.
(In this text files first number is vertex number, other is edge number)
Vertices are kept in queue structure.
Physical representation in showed with min heap array
In this array includes:
* Node number * edge weights
In min heap, each node has an edge weight and first node has zero weight in
The other ones unknown.
These vertices replaced in min heap, according to their edge weights.
There should be one array for a node that which order in the min heap tree
( I assumed this array with W)
There should be an array for keep the information of the where the
previous node came from, in this min heap structure
(I assumed this array with X)
- If we take a node from the min heap. Min heap works as default.
Some changes are happen in min heap
and this changes reflected the X array members.
Also array W is impressed by these changes.
After the changing operation. Behind the left of the W array insert some Characters ( - , #) or something.
And then, there should be an array for "array's members are in queue or not"
(I assumed this array with K)
If available, array K is filled with related vertex order in TRUE
Or not array K is filled with related vertex order in FALSE
This requirements are seems like complicated but
If you understand clearly, look at the pdf file .
After the execute this algorithm has measures the running times
The running times of this algorithm for each data file will be recorded.
and prints on the screen just like: "Algortihm takes for [url removed, login to view]: 13.2 s"
I expected that this algorithm runnning time is very short.
When these algorithm are coded I want comment lines in all possible lines.
I want this project on Monday.