Представление сети с помощью связанного списка

Размещено на http://www.allbest.ru/

ФЕДЕРАЛЬНОЕ АГЕНТСТВО СВЯЗИ

Федеральное государственное бюджетное образовательное учреждение высшего образования

«Санкт-Петербургский государственный университет телекоммуникаций им. проф. М.А. Бонч-Бруевича»

КАФЕДРА ИНФОРМАЦИОННО-УПРАВЛЯЮЩИХ СИСТЕМ

Практическая работа

Представление сети с помощью связанного списка

по дисциплине «Сети хранения данных»

Студент Петрова Е.Е.

информационный сеть код компилятор

Санкт-Петербург 2020 год

Выполним представление сети из 5 узлов и 4 ветвей, используя онлайн-компилятор для следующего кода на языке C# для варианта 71111:

//Rextester.Program.Main is the entry point for your code. Don't change it.

//Compiler version 4.0.30319.17929 for Microsoft (R) .NET Framework 4.5

using System;

using System.Collections.Generic;

using System.Linq;

using System.Text.RegularExpressions;

namespace Rextester

{

using s_network = Struct_SimpeNetwork.SimpleNetwork;

using s_vertex = Struct_SimpeNetwork.SimpleNetwork.SimpleVertex;

using s_edge = Struct_SimpeNetwork.SimpleNetwork.SimpleEdge;

public struct Struct_SimpeNetwork

{

public struct SimpleNetwork

{

// declare arrays and data

public IList<SimpleVertex> arr_vertexes;

public IList<SimpleEdge> arr_edges;

public int num_of_vertexes;

public int num_of_edges;

// structure for vertex //VVVVVVVVVVVVVVVVVVVVVVVVVVVV

public struct SimpleVertex //VVVVVVVVVVVVVVVVVVVVVVVVV

{

// struct data

public int number;

public ConsoleColor color;

public int x_coord, y_coord;

} //VVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVV

// structure for edge //EEEEEEEEEEEEEEEEEEEEEEEEEEEEEE

public struct SimpleEdge //EEEEEEEEEEEEEEEEEEEEEEEEEEE

{

// struct data

public SimpleVertex begin_SimpleVertex;

public SimpleVertex end_SimpleVertex;

public ConsoleColor color;

// struct constructor

} //EEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEE

}

}

public class Program

{

public static void Main(string[] args)

{

int Num = 71111;

// initializing the network

s_network netw = new s_network();

netw.arr_vertexes = new List<s_vertex>();

netw.arr_edges = new List<s_edge>();

// Task 1)

netw.num_of_vertexes = 5;

netw.num_of_edges = netw.num_of_vertexes-1;

// define array's data

for(int num_i = 0; num_i < netw.num_of_vertexes; num_i++)

{ // vertexes are set at the diagonal line

// (узлы расставляются по диагонали

s_vertex new_v = new s_vertex(); //(num_i, ConsoleColor.Black, num_i*10, num_i*10);

new_v.number = num_i;

new_v.color = (ConsoleColor)num_i;

new_v.x_coord = (Num+2*num_i)%21;

new_v.y_coord = (Num+2*num_i)%22;

netw.arr_vertexes.Add(new_v);

}

for(int num_i = 0; num_i < netw.num_of_edges; num_i++)

{

// edges are concatenated the vertexes by diagonal

// (ветви соединяют соответствующие узлы по диагонали: (0->1), (1->2), (2->3), (3->4))

s_edge new_ed = new s_edge();

new_ed.begin_SimpleVertex = netw.arr_vertexes[num_i];

new_ed.end_SimpleVertex = netw.arr_vertexes[num_i + 1];

new_ed.color = new_ed.begin_SimpleVertex.color;

netw.arr_edges.Add(new_ed);

}

OutNetworkData(netw);

// Task 2)

for(int num_i = 0; num_i < netw.num_of_vertexes; num_i++)

{

s_vertex v = netw.arr_vertexes[num_i];

v.x_coord = ((Num + 100*num_i)%31)/2;

v.y_coord = (Num + 100*num_i)%22;

netw.arr_vertexes[num_i] = v;

}

OutNetworkData(netw);

// Task 3

for(int num_i = 0; num_i < netw.num_of_edges; num_i++)

{

s_edge ed = netw.arr_edges[num_i];

ed.begin_SimpleVertex = netw.arr_vertexes[(Num / (num_i+1))%netw.num_of_vertexes];

ed.end_SimpleVertex = netw.arr_vertexes[(Num + num_i*num_i)%netw.num_of_vertexes];

ed.color = ed.begin_SimpleVertex.color;

netw.arr_edges[num_i] = ed;

}

OutNetworkData(netw);

}

public static void OutNetworkData(s_network network)

{

// output data

string str = "Vertex'es data:";

Console.WriteLine(str);

for(int num_i = 0; num_i < network.num_of_vertexes; num_i++)

{ // output all vertex data

str = "number = " + network.arr_vertexes[num_i].number.ToString() +

", Color = " + network.arr_vertexes[num_i].color.ToString() +

", x = " + network.arr_vertexes[num_i].x_coord.ToString() +

", y = " + network.arr_vertexes[num_i].y_coord.ToString();

Console.WriteLine(str);

}

str = "Edge's data:";

Console.WriteLine(str);

for(int num_i = 0; num_i < network.num_of_edges; num_i++)

{ // output all edges data

str = "index " + num_i.ToString() + ": begin_Vertex = {number = " +

network.arr_edges[num_i].begin_SimpleVertex.number.ToString() +

", color = " + network.arr_edges[num_i].begin_SimpleVertex.color.ToString() +

"},\n end_Vertex = {number = " + network.arr_edges[num_i].end_SimpleVertex.number.ToString() +

", color = " + network.arr_edges[num_i].end_SimpleVertex.color.ToString() +

"}, edge's color = " + network.arr_edges[num_i].color.ToString();

Console.WriteLine(str);

}

//Console.ReadKey();

}

}

}

В результате работы программы получим:

Vertex'es data:

number = 0, Color = Black, x = 5, y = 7

number = 1, Color = DarkBlue, x = 7, y = 9

number = 2, Color = DarkGreen, x = 9, y = 11

number = 3, Color = DarkCyan, x = 11, y = 13

number = 4, Color = DarkRed, x = 13, y = 15

Edge's data:

index 0: begin_Vertex = {number = 0, color = Black},

end_Vertex = {number = 1, color = DarkBlue}, edge's color = Black

index 1: begin_Vertex = {number = 1, color = DarkBlue},

end_Vertex = {number = 2, color = DarkGreen}, edge's color = DarkBlue

index 2: begin_Vertex = {number = 2, color = DarkGreen},

end_Vertex = {number = 3, color = DarkCyan}, edge's color = DarkGreen

index 3: begin_Vertex = {number = 3, color = DarkCyan},

end_Vertex = {number = 4, color = DarkRed}, edge's color = DarkCyan

Vertex'es data:

number = 0, Color = Black, x = 14, y = 7

number = 1, Color = DarkBlue, x = 2, y = 19

number = 2, Color = DarkGreen, x = 5, y = 9

number = 3, Color = DarkCyan, x = 9, y = 21

number = 4, Color = DarkRed, x = 12, y = 11

Edge's data:

index 0: begin_Vertex = {number = 0, color = Black},

end_Vertex = {number = 1, color = DarkBlue}, edge's color = Black

index 1: begin_Vertex = {number = 1, color = DarkBlue},

end_Vertex = {number = 2, color = DarkGreen}, edge's color = DarkBlue

index 2: begin_Vertex = {number = 2, color = DarkGreen},

end_Vertex = {number = 3, color = DarkCyan}, edge's color = DarkGreen

index 3: begin_Vertex = {number = 3, color = DarkCyan},

end_Vertex = {number = 4, color = DarkRed}, edge's color = DarkCyan

Vertex'es data:

number = 0, Color = Black, x = 14, y = 7

number = 1, Color = DarkBlue, x = 2, y = 19

number = 2, Color = DarkGreen, x = 5, y = 9

number = 3, Color = DarkCyan, x = 9, y = 21

number = 4, Color = DarkRed, x = 12, y = 11

Edge's data:

index 0: begin_Vertex = {number = 1, color = DarkBlue},

end_Vertex = {number = 1, color = DarkBlue}, edge's color = DarkBlue

index 1: begin_Vertex = {number = 0, color = Black},

end_Vertex = {number = 2, color = DarkGreen}, edge's color = Black

index 2: begin_Vertex = {number = 3, color = DarkCyan},

end_Vertex = {number = 0, color = Black}, edge's color = DarkCyan

index 3: begin_Vertex = {number = 2, color = DarkGreen},

end_Vertex = {number = 0, color = Black}, edge's color = DarkGreen

Представим графически 3 графа сети (Task_1, Task_2 и Task_3 в коде), представленных в данном коде (рис.1.).

Рис.1. Представление графа сети в результате выполнения задания

Размещено на Allbest.ru

...