1
Download BACHELOR THESIS
Transcript
CHAPTER 5. ALGORITHMS AND EXPERIMENTS 29 Figure 5.1: I took easy topology with distribution of neurons in Fig. 4.3 and on figure we can see the results. Left network is for ”easy circle” and right result is for ”computed circle”. We see that ”computed circle” algorithm tries to place strong binded neurons nearby. In finished state, computed circle has less crossings in the midle of circle and is clearer. In its first part solveMatrix is filled from the strongest to the lightest bind in workBinds list. It means, algorithm gradually takes each bind and summarize solveMatrix row corresponding with shooting neuron and row corresponding with shot neuron. If both neurons have less than two neibourghs (are connected to one or zero neurons) ones on corresponding positions in matrix are set up. Second part of algorithm solve outright on circle (saved to field result). If algorithm does not have sequence of neurons it finds first neuron with single binded neuron which is possibly pheriperal for different sequence.
