Writing 3 functions for the C++ graph class

C & C++ — incorrectly specified categories?

31 USD

Client's review of cooperation with Bohdan Z.

Writing 3 functions for the C++ graph class

31 USD

He worked well, but expensive.

4.5

Profile deleted

Reciprocal Feedback

16 January 2022

Freelancer's review of cooperation with client

Writing 3 functions for the C++ graph class

31 USD

The task is clearly set.
After the work on the project was completed, Polina didn’t get in touch for 3 days and didn’t close it.
I closed, I have no claims.

3.8

Bohdan Z.

Reciprocal Feedback

16 January 2022

Project translated automatically. Log in or register, to view the original There’s already a workcode, you just need to re-work 3 functions in the Graph class and call them to main (there may be need for additional functions).You also need to comment on the code.At the start of the program, you need to specify the name of the file from which the graph will be read, and then the file to which it will be recorded.For example: by input.txt by output.txt Then there will be a menu. in input.txt the graph heated and oriented is filled as follows: the starting top; the top to which the hole is directed; the weight In the buff.txt file there are examples of different graphs.The following functions are all taken into account by weight: The excentricity of the top is the maximum distance from all the minimum distances from the other top to the top.The graffiti radius is the minimum of the excentricities of its heights.Find the center of the graffiti - many heights whose excentricities are equal to the radius of the graffiti Determine whether there is a top in the graph, each of the minimum values of the road from which to the rest does not exceed N. Find all such a pair of heights that there is a path between them as little as long as possible.