Contents
What is the minimum distance between vessels?
The distance between two queuing vessels is as follows: 1 nautical mile (nm) in between (over 20,000 g.r.t.) 0.5 nm in between (500 g.r.t ∼ 20,000 g.r.t.) 4 times a ship’s length for ships under 500 g.r.t.
What side of the vessel should you never anchor?
stern
Never tie off an anchor to the stern of a boat, or try to pull up a stuck anchor by pulling with the engine after securing the rode to a stern cleat. You may actually pull the stern low enough to swamp the boat—water may come over the stern and fill the boat—resulting in a very dangerous situation.
What is the minimum required number of flares you should have on your vessel?
three
If pyrotechnic devices are selected, a minimum of three must be carried. Any combination can be carried as long as they add up to three signals for day use and three signals for night use. Three day/night signaling devices meet both requirements.
How to calculate the distance between two cells in a matrix?
Consider each cell as a node and each boundary between any two adjacent cells be an edge. Number each cell from 1 to N*M. Now, push all the node whose corresponding cell value is 1 in the matrix in the queue. Apply BFS using this queue to find the minimum distance of the adjacent node.
What is the return distance of a matrix?
Return distance when destination is met, else return -1 (no path exists in between source and destination). This article is contributed by Prashant Singh. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to [email protected].
How to find the nearest element in a matrix?
For every element find the closest element which contains 1. To find the closest element traverse the matrix and find the minimum distance. Fill the minimum distance in the matrix. Time Complexity: O (N 2 *M 2 ). For every element in the matrix, the matrix is traversed and there are N*M elements So the time complexity is O (N 2 *M 2 ).
How to find the shortest path in a matrix?
The idea is to BFS (breadth first search) on matrix cells. Note that we can always use BFS to find shortest path if graph is unweighted. Store each cell as a node with their row, column values and distance from source cell. Start BFS with source cell.