
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN: 9780133594140
Author: James Kurose, Keith Ross
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Question
Please use your own code, don't copy from a website
C++
![**Title: Shortest Path Between Skyscrapers in a 2D Grid**
**Description:**
This problem involves finding the shortest possible path between two skyscrapers in a 2D grid. The goal is to determine the minimum number of planks needed to construct the path.
**Instructions:**
1. **Input Details**: You are given a string representing a 2D array of integers, indicating the locations of the skyscrapers.
2. **Grid Definition**:
- Each skyscraper is defined as a group of 1's that are connected directionally (North, South, East, or West).
- 0's represent empty spaces, which each equate to one unit of distance.
3. **Path Construction**:
- You can place planks only on 0's and must connect them to a skyscraper or another plank.
- Movement is restricted to 4 directions (no diagonal movements allowed).
4. **Objective**: Return the smallest number of planks needed to connect the two skyscrapers.
**Example Cases**:
- **Case 1**:
- **Input**: `[[1,0,0,0],[0,0,0,0],[0,1,0],[0,0,1]]`
- **Output**: 2
- **Case 2**:
- **Input**: `[[1,1,0,0,0],[1,0,0,0,0],[0,0,0,1,1],[0,0,1,1],[0,1,0,0,0]]`
- **Output**: 3
- **Case 3**:
- **Input**: `[[0,0,0,0,0,0,0,0],[0,1,1,0,0,0,1,1],[0,0,1,1,1,0,0],[0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0]`
- **Output**: 4
**Assumptions**:
- The grid contains exactly two skyscrapers.
- The distance between the skyscrapers is at least 1.
- An unlimited number](https://content.bartleby.com/qna-images/question/163c017a-5d21-431a-9ee4-8297ed7826e9/2fba8520-e661-4467-a88c-e1b34ff95b46/ganuy8na_thumbnail.jpeg)
Transcribed Image Text:**Title: Shortest Path Between Skyscrapers in a 2D Grid**
**Description:**
This problem involves finding the shortest possible path between two skyscrapers in a 2D grid. The goal is to determine the minimum number of planks needed to construct the path.
**Instructions:**
1. **Input Details**: You are given a string representing a 2D array of integers, indicating the locations of the skyscrapers.
2. **Grid Definition**:
- Each skyscraper is defined as a group of 1's that are connected directionally (North, South, East, or West).
- 0's represent empty spaces, which each equate to one unit of distance.
3. **Path Construction**:
- You can place planks only on 0's and must connect them to a skyscraper or another plank.
- Movement is restricted to 4 directions (no diagonal movements allowed).
4. **Objective**: Return the smallest number of planks needed to connect the two skyscrapers.
**Example Cases**:
- **Case 1**:
- **Input**: `[[1,0,0,0],[0,0,0,0],[0,1,0],[0,0,1]]`
- **Output**: 2
- **Case 2**:
- **Input**: `[[1,1,0,0,0],[1,0,0,0,0],[0,0,0,1,1],[0,0,1,1],[0,1,0,0,0]]`
- **Output**: 3
- **Case 3**:
- **Input**: `[[0,0,0,0,0,0,0,0],[0,1,1,0,0,0,1,1],[0,0,1,1,1,0,0],[0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0]`
- **Output**: 4
**Assumptions**:
- The grid contains exactly two skyscrapers.
- The distance between the skyscrapers is at least 1.
- An unlimited number
Expert Solution

This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution
Trending nowThis is a popular solution!
Step by stepSolved in 3 steps with 4 images

Knowledge Booster
Similar questions
- C++ OOP You are creating an Employee Record App. Following information is required to store.o name. A string that holds the employee’s name.o idNumber. An int variable that holds the employee’s ID number.o department. A string that holds the name of the department where the employeeworks.o position. A string that holds the employee’s job title.o CovidStatus: Either the employee has been covid Positive or not.arrow_forwardC Language programming Write a program that displays the following message exactly. Submit a screenshot of the program running on Eustis as well if possible. Output: My name is John Smith. I am a student . I am happy to be here. I am very excited to learn the C Languagearrow_forwardPlease give me the html code of this programarrow_forward
arrow_back_ios
arrow_forward_ios
Recommended textbooks for you
- Computer Networking: A Top-Down Approach (7th Edi...Computer EngineeringISBN:9780133594140Author:James Kurose, Keith RossPublisher:PEARSONComputer Organization and Design MIPS Edition, Fi...Computer EngineeringISBN:9780124077263Author:David A. Patterson, John L. HennessyPublisher:Elsevier ScienceNetwork+ Guide to Networks (MindTap Course List)Computer EngineeringISBN:9781337569330Author:Jill West, Tamara Dean, Jean AndrewsPublisher:Cengage Learning
- Concepts of Database ManagementComputer EngineeringISBN:9781337093422Author:Joy L. Starks, Philip J. Pratt, Mary Z. LastPublisher:Cengage LearningPrelude to ProgrammingComputer EngineeringISBN:9780133750423Author:VENIT, StewartPublisher:Pearson EducationSc Business Data Communications and Networking, T...Computer EngineeringISBN:9781119368830Author:FITZGERALDPublisher:WILEY

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 Engineering
ISBN:9780124077263
Author:David A. Patterson, John L. Hennessy
Publisher:Elsevier Science

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
Computer Engineering
ISBN:9781337093422
Author:Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:Cengage Learning

Prelude to Programming
Computer Engineering
ISBN:9780133750423
Author:VENIT, Stewart
Publisher:Pearson Education

Sc Business Data Communications and Networking, T...
Computer Engineering
ISBN:9781119368830
Author:FITZGERALD
Publisher:WILEY