Program for calculating stochastic connectivity degree of undirected graphs

<p>In the contemporary world problem of stochastic connectivity robustness of graphs has</p><p>a large interest in science and in practice. Such a problem combines elements of combinatory</p><p>and probability theory. Given paper proposes a description of the study of this issue. The</p><p>aim of it is to develop a software product that allows to test graph structures according to this</p><p>criterion and to demonstrate the ability to implement competent development. This paper</p><p>reviews the work that has already been done, the materials that have been studied related to</p><p>the topic. Some basic material and information about architecture, design, algorithms and</p><p>implementation and the clarifications of reasons for usage of chosen methods can be found</p><p>as well. The emphasis will be on the algorithms. This part is the most critical in the study.</p><p>Finally, the results of the accomplished work and future outcome of still undone work will be</p><p>presented in the conclusion of the paper.</p>