Contents of Report

[Data of Report]

	Abstract	.... 2
	Forewords	.... 3
	Acknowledgements	.... 3
	Introduction	.... 4
1	Module readfile	.... 5
1.1	File structure	.... 5
1.2	Reading the file	.... 5
2	Module lk	.... 7
2.1	The topmost(public)Predicate	.... 7
2.2	Initializing Position string and connection matrix	.... 7
2.3	Start of parallel work and control	.... 29
3	Module tree	.... 10
3.1	For a node in the Tree	.... 10
3.2	Head of the tree	.... 11
3.3	Communication Process	.... 12
3.4	Pair determination	.... 13
4	Module algo	.... 16
4.1	From a list of set-pairs...	.... 16
4.2	Building the intermediary structure	.... 16
4.3	Lin-Kernighan algorithm	.... 19
4.4	Searching the gain lists	.... 20
4.5	The Quest for the best permutation	.... 22
5	Module Test	.... 26
5.1	Time measurements	.... 26
5.2	Usage	.... 27
5.3	Generation of a complete graph	.... 27
5.4	Generating of a square graph	.... 28
6	Examples	.... 31
6.1	Simple examples	.... 31
6.2	Graph with no edges	.... 32
6.3	Grid-shaped graph	.... 33
6.4	Conclusions	.... 35
7	Contents	.... 36
	References	.... 37

目次をクリックすると、PDFファイルが表示されます。