Answered: C PROGRAMMING. using the following program as a start point: /* * NetworkServer.c * ProgrammingPortfolio Skeleton * */ /* You will need to include…

/* You will need to include these header files to be able to implement the TCP/IP functions */
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <sys/types.h>
#include <netinet/in.h>
#include <netdb.h>
#include <fcntl.h>
#include <unistd.h>
#include <errno.h>
#include <sys/socket.h>

/* You will also need to add #include for your graph library header files */

int main(int argc, const char * argv[])
{
int serverSocket = -1;

printf("Programming Portfolio 2022 Implementation\n");
printf("=========================================\n\n");

/* Insert your code here to create, and the TCP/IP socket for the Network Server
*
* Then once a connection has been accepted implement protocol
*/

TASK:

you are to write a TCP/IP server that can build up a graph of a network of
networks (using the supplied graph library (graph.h) and implementation of Dijkstra’s (Dijkstra.h) algorithm) and then
query that graph to find out which link between two networks should be used as the next hop to
send a packet of data from one network to another within the network of networks (using the
supplied implementation of Dijkstra’s algorithm).

h graph.h 1.16 KB
1 #ifndef _GRAPH_H
#define _GRAPH_H
2
3
4 #include "linked_list.h"
5
6
7
8
9
/* each node in the adjacency List stores a vertex */
10 /* a vertex has a unique numerical id */
11
11
12
12
17
13
14
15
16
17
18
LO
19
20
21
4
22
23
24
47
25
4
26
20
27
28
co
29
SO
30
24
34
25
35
36
27
37
20
39
40
40
/* a graph represented as an adjacency List /
typedef LinkedList Graph;
41
41
42
43
T
/* and stores a list of edges from the vertex ³/
typedef struct Vertex {
int id;
LinkedList "edges;
MA
31
32
33 void add_edge_undirected (Graph *, int, int, double);
void remove_edge (Graph *, int, int);
void remove_edges (Graph *, int);
48
19
49
50
} vertex;
/* each node in the list of edges for a vertex store the edge weight */
/* and the destination vertex 3/
typedef struct Edge {
double weight;
Vertex *vertex;
} Edge;
/* function prototypes */
Vertex *init_vertex(int);
20
38 void free_vertex (Vertex *);
Graph *init_graph (void);
void free_graph (Graph *);
void print_graph (Graph *);
Vertex *find_vertex (Graph *, int);
vertex *add_vertex (Graph *, int);
void remove_vertex (Graph *, int);
Edge *add_edge (Graph *, int, int, double);
Edge *init_edge (void);
void free_edge (Edge *);
int *get_vertices (Graph *, int *);
Edge **get_edges (Graph *, Vertex *, int *);
44
44
45 Edge *get_edge (Graph *, int, int);
46 int edge_destination (Edge *);
47
double edge_weight (Edge *);
#endif
Open in Web IDE
v
Replace Delete GOJ

h dijkstra.h379 bytes
1
2
3
4
5
6
*
*
*
*/
dijkstras.h
Programming Portfolio
7
#ifndef dijkstra_h
8 #define dijkstra_h
9
10
/* an entry storing the shortest path */
11
/* next_hop is the next vertex in the path */
12
/* weight is the total weight of the path to dst */
13 typedef struct Path
14
{
15
16
17
18
19
20 Path *dijkstra (Graph *graph, int id, int *pnEntries);
21
22 #endif /* dijkstras_h */
23
int next_hop;
double weight;
} Path;
Open in Web IDE
V
Replace
Delete
G

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

See solution Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Step 3

VIEW

Step by stepSolved in 3 steps

See solution

Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

All files are included below, seperated by the dashes. "----" //driver.cpp #include <iostream> #include <string> #include "stackLL.h" #include "queueLL.h" #include "priorityQueueLL.h" using namespace std; int main() { /////////////Test code for stack /////////////// stackLLstk; stk.push(5); stk.push(13); stk.push(7); stk.push(3); stk.push(2); stk.push(11); cout<<"Popping: "<<stk.pop() <<endl; cout<<"Popping: "<<stk.pop() <<endl; stk.push(17); stk.push(19); stk.push(23); while( ! stk.empty() ) { cout<<"Popping: "<<stk.pop() <<endl; } // output order: 11,2,23,19,17,3,7,13,5 stackLLstkx; stkx.push(5); stkx.push(10); stkx.push(15); stkx.push(20); stkx.push(25); stkx.push(30); stkx.insertAt(-100, 3); stkx.insertAt(-200, 7); stkx.insertAt(-300, 0); //output order: -300,30,25,20,-100,15,10,5,-200 while( ! stkx.empty() ) cout<<"Popping: "<<stkx.pop() <<endl; ///////////////////////////////////////…
Please answer in C++
C++ shapes.h: #include <iostream>#include <cmath>struct Point2d{double x;double y;void print(){// example: (2.5,3.64)std::cout << "(" << x << "," << y << ")" << std::endl;}double length() const{return std::sqrt(x * x + y * y);}// const Point2D & ==> function can't modify 'other'// the second const ==> function can't modify x, yPoint2d add(const Point2d &other) const{Point2d result;result.x = x + other.x;result.y = y + other.y;return result;}};// example of an interfacestruct Shape{virtual bool contains(Point2d p) = 0;};struct Circle : Shape{Point2d center;double radius;bool contains(Point2d p){Point2d diff;diff.x = p.x - center.x;diff.y = p.y - center.y;double distToCenter = diff.length();return distToCenter <= radius;}};// TODO: replace this with your Rectangle implementationstruct Rectangle : Shape{// TODO: which member variables to model a rectangle?bool contains(Point2d p){return false; // TODO }};//…

Recommended textbooks for you

Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education