Given the Point structure defined below, complete the function that computes the length of a path passed as a vector of Point pointers. pathlength.cpp #include "point.h" #include // need sqrt, pow 3 1 2 #include 4 using namespace std; 5 double pathLength(const vector& path) 7 { double result{0.0}; for (. . .) { 10 11 12 13 } 14 return result; } 15 16 Tester.cpp 1 #include #include 3 using namespace std; 4 #include "point.h" 6 int main() { 9. 7 8 vector a{{0,0}, {0,1}, {1,1}, {1,0}, {0,0}}; const vector v{&a[0], &a[1], &a[2], &a[3], &a[4]}; 10 11 12 cout « pathLength(v) « endl; cout « "Expected: 4" « endl; 13 14 a = vector{{1, 0}, {0, 1}, {-1, 0}, {0, -1}}; const vector v1{&a[0], &a[1], &a[2], &a[3]}; 15 16 17 18 cout « pathLength(v1) <« endl; cout « "Expected: 4.24264" « endl; 19 20 21 point.h 1 #ifndef ΡΟINT Η #define POINTH 3 4 #include struct Point { double x; double y; }; 10 5 7 9. 11 double pathLength(const std::vector& path); 12 13 #endif

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question

C++ Please help!

Given the Point structure defined below, complete the function that computes the length of a path
passed as a vector of Point pointers.
pathlength.cpp
#include "point.h"
#include <cmath> // need sqrt, pow
1
2
3
#include <vector>
4
using namespace std;
double pathLength(const vector<Point*>& path)
7
{
8
double result{0.0};
9.
10
for (. . .)
11
12
13
}
14
return result;
}
15
16
Tester.cpp
1
#include <iostream>
#include <vector>
using namespace std;
4
3
#include "point.h"
int main()
{
9.
7
8
vector<Point> a{{0,0}, {0,1}, {1,1}, {1,0}, {0,0}};
const vector<Point*> v{&a[0], &a[1], &a[2], &a[3], &a[4]};
10
11
12
cout « pathLength(v) <« endl;
cout « "Expected: 4" < endl;
13
14
15
a = vector<Point>{{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
const vector<Point*> v1{&a[0], &a[1], &a[2], &a[3]};
16
17
cout « pathLength(v1) <« endl;
cout « "Expected: 4.24264" « endl;
18
19
20
21
}
point.h
1
#ifndef POINT H
2
#define POINT H
3
4
#include <vector>
struct Point
{
double x;
double y;
7
8.
};
10
11
double pathLength(const std::vector<Point*>& path);
12
13
#endif
CodeCheck
Reset
Transcribed Image Text:Given the Point structure defined below, complete the function that computes the length of a path passed as a vector of Point pointers. pathlength.cpp #include "point.h" #include <cmath> // need sqrt, pow 1 2 3 #include <vector> 4 using namespace std; double pathLength(const vector<Point*>& path) 7 { 8 double result{0.0}; 9. 10 for (. . .) 11 12 13 } 14 return result; } 15 16 Tester.cpp 1 #include <iostream> #include <vector> using namespace std; 4 3 #include "point.h" int main() { 9. 7 8 vector<Point> a{{0,0}, {0,1}, {1,1}, {1,0}, {0,0}}; const vector<Point*> v{&a[0], &a[1], &a[2], &a[3], &a[4]}; 10 11 12 cout « pathLength(v) <« endl; cout « "Expected: 4" < endl; 13 14 15 a = vector<Point>{{1, 0}, {0, 1}, {-1, 0}, {0, -1}}; const vector<Point*> v1{&a[0], &a[1], &a[2], &a[3]}; 16 17 cout « pathLength(v1) <« endl; cout « "Expected: 4.24264" « endl; 18 19 20 21 } point.h 1 #ifndef POINT H 2 #define POINT H 3 4 #include <vector> struct Point { double x; double y; 7 8. }; 10 11 double pathLength(const std::vector<Point*>& path); 12 13 #endif CodeCheck Reset
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 1 images

Blurred answer
Similar questions
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY