IntroductionIntroduction

The Internet can be viewed from both physical and logical perspectives. From a physical point of view,

the Internet is a collection of web servers connected together with fibre optic cables. From a logical point

of view, the Internet is a collection of webpages connected together with hyperlinks. For this assignment,

both perspectives are modeled as graphs in the following ways.

Server Graph

The collection of servers, on one hand, is represented by an undirected, unweighted server graph $S=(V,E)$

where:

each vertex $sinV$ represents a web server and

each undirected edge $(s,t)inE$ represents the physical connection between server s and server $t.$

Each server has a unique name and a list of the webpages that it hosts. Also, there is no hard limit on the

number of servers.

Web Graph

The collection of webpages, on the other hand, is represented by a directed, unweighted web graph $W=$

$(V,E)$ where:

each vertex uinV is a webpage and

each directed edge $(u,v)inE$ is a hyperlink from webpage $u$ to webpage $v.$ To simplify our discussion,

there is at most one hyperlink from $u$ to $v.$

Each webpage has a unique name as well as the name of the server that hosts it$.$

Task $1$: Server Graph $(43$ marks$)$

Using the partial definitions below, implement and test the server graph as an expandable adjacency

matrix.

public claso ServerGraph

$\frac{\frac{?}{?}}{3}$ aaric

private clasa vebserver

public string Nane;

public Liatv$\frac{\frac{?}{?}}{?}=1\frac{\frac{?}{?}}{?}v\frac{\frac{?}{?}}{?}\frac{\frac{?}{?}}{?}\frac{\frac{?}{?}}{?}$

The Internet can be viewed from both physical and logical perspectives. From a physical point of view,

the Internet is a collection of web servers connected together with fibre optic cables. From a logical point

of view, the Internet is a collection of webpages connected together with hyperlinks. For this assignment,

both perspectives are modeled as graphs in the following ways.

Server Graph

The collection of servers, on one hand, is represented by an undirected, unweighted server graph $S=(V,E)$

where:

each vertex $sinV$ represents a web server and

each undirected edge $(s,t)inE$ represents the physical connection between server $s$ and server $t.$

Each server has a unique name and a list of the webpages that it hosts. Also, there is no hard limit on the

number of servers.

Web Graph

The collection of webpages, on the other hand, is represented by a directed, unweighted web graph $W=$

$(V,E)$ where:

each vertex uinV is a webpage and

each directed edge $(u,v)inE$ is a hyperlink from webpage $u$ to webpage $v.$ To simplify our discussion,

there is at most one hyperlink from $u$ to $v.$

Each webpage has a unique name as well as the name of the server that hosts it$.$