Write a Python function that takes in three parameters - an adjacency matrix of a simple directed graph, a start node, and an end node; and returns "True" if there is a way to get fromthe start node to the end node using the provided edges.You can use this file as a starter code: path.py ↓For example:Using the same graph given above. Consider your function with the same adjacency matrix given above as input and:If the start node is 1 and the end node is 4 then your function should return True.If the start node is 2 and the end node is 4 then your function should return False.Input:This function will have three parameters. First is an adjacency matrix in the form of a list of lists (as given above). Then the start_node and the end_node will be integers. Note thatpython indexing starts from 0 and not from 1, so the naming of the nodes will also follow the python convention and start from 0 instead of 1.Output:Boolean value: True or False.

The trouble may be solved the use of any of the graph traversal and the use of positive sentinals…

Write a Python function that takes in three parameters - an adjacency matrix of a simple directed graph, a start node, and an end node; and returns "True" if there is a way to get from the start node to the end node using the provided edges.

Write a Python function that takes in three parameters - an adjacency matrix of a simple directed graph, a start node, and an end node; and returns "True" if there is a way to get from the start node to the end node using the provided edges.

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter5: Repetition Statements

Section5.5: A Closer Look: Loop Programming Techniques

Problem 12E: (Program) Write a program that tests the effectiveness of the rand() library function. Start by...

See similar textbooks

Similar questions

Write and test a Python function, that makes use of numpy, to return the sum of the elements onthemain diagonal (upper left to lower right) of a square matrix. In linear algebra, this value is calledthetrace of the matrix.For example, with a matrix represented as a list of lists eg. [[9, 8, 7], [6, 5, 4], [3, 2, 1]], yourfunctionshould return (9 + 5 + 1) = “15”Your Python function solution should work for any sized square matrix passed to it. Demonstratethat this is the case with 3x3, 4x4, and 6x6 matrix examples.
Write a function that gets an array of points and sorts the array using qsort(). Given two points a=(ax,ay) and b=(bx,by) we compare them as follows: 1) if (ax)2+(ay)2 < (bx)2+(by)2, then a should come before b in the sorted array. 2) if (ax)2+(ay)2 = (bx)2+(by)2, then we compare the points by the x coordinate. Remark: For a point a=(ax,ay) the quantity ((ax)2+(ay)2)½ is the distance of a from the (0,0). That is, we sort the points according to their distance to (0,0), and if for points at the same distance, then we sort them according to the first coordinate. You will need to implement the comparison function, and apply qsort() on the array with this comparison function. For example: - Input: [(3,2), (7,1), (1,1), (3,4), (5,0), (7,1)] - Expected output: [(1,1), (3,2), (3,4), (5,0), (7,1), (7,1) ] Explanation: (1,1) is first because 12+12=2 is the smallest (3,2) is next because 32+22 = 13 is the second smallest Both (3,4) and (5,0) have the same sum of squares, 25, but 3<5 so…
In this question, we are going to write a Racket functionwordMaxIndex that calculates the maximum index of each word thatappears in an input word list. For example, if the input is’(time is long but life is short)Then one output can be((time 0) (long 2) (but 3) (life 4) (is 5) (short 6))The index of the first word in a word list is 0; the index for the secondword is 1; etc. Therefore, in the previous example, the maximum indexfor word “time” is 0; the maximum index for word “is” is 5, since “is”appears twice, at index 1 and 5. Note that you are not asked to sortthe words in the output. Therefore, the output is correct as long asthe indexes are correct.Do the following steps to implement the word-index program. In ourdiscussion, we call a word with an index a word-index pair, for example,(short 6) and (is 5) are word-index pairs. We call a list of word-index pairs a word-index list.(a) Write a function initialWIList that takes a list ofwords and creates a word-index list. The resulting…
Write a function below that will take a 2d array of booleans representing a map as a parameter which will construct a vgraph as a searchable graph. You many use go, python or java do to this.
Write a function(in pyhton) that takes a list of distinct integers l, and an integer k. Your function then finds the index of the integer in l, whose removal from l results in a list whose sum is k. For example, given [3,6,4,1,5,2] and 18, your function should return index 0, which corresponds to 3 in the list. Because, when 3 is removed from the list, the sum of the remaining list [6,4,1,5,2] is 18. You can assume that the given problem is always solvable.
In this problem you will implement a function called triangle_countwhich will take as input a graph object G, representing an undirectedgraph G, and will return the number of triangles in G. Do not use anyimports for this problem. To simplify the problem you may assume thateach edge is stored twice in G. That is if an edge goes from u to v then vwill be in u’s collection and u will be in v’s collection. If you would prefer,you may assume that an edge is only stored once. In either case G willneed to be regarded as undirected.
Write the code in python to define the function has_adjacent_repeats(mystr), which takes a string parameter and returns a boolean result. - If mystr has at least one instance of adjacent characters being equal, return True - Otherwise, return False Hint: You can iterate over the positive indices i for characters in mystr: 1, 2, 3, ...., len(mystr)-1 with a for loop. For each i, if the character at index i matches the character at index i - 1, return True. Otherwise, if no doubled character is found in the entire string, return False. For example: Test Result if not (has_adjacent_repeats("NOODLES") is True): print("error") if not (has_adjacent_repeats("Bananas") is False): print("shwoopsie") if not (has_adjacent_repeats("Hanoverr") is True): print("error")
Write a python program and add a function called add_matrix() to it. This functiontakes two 2-D lists of integers (matrix) as parameters and computes their sum, if a sumcan actually be computed. Otherwise, it returns an empty list. Note that, two matrices canonly be added together if they have the exact same dimensions. If the dimensions areacceptable, then the resulting matrix will also have the same dimensions as its operands,and the value of each element in the resulting matrix is the sum of the correspondingelements in the input matrices.Hint: test rectangularity (the number of rows and the number of elements in each rowmust be the same in two matrices) before attempting addition.Sample output:>>> matrix1 = [[2,3], [4,5]]>>> matrix2 = [[9,0], [8,6]]>>> print(add_matrix(matrix1, matrix2))[[11, 3], [12, 11]]
Write a python code of a function that takes in four points in a counterclockwise order, a, b, c, d and return true if the quadrilateral is convex and false if it is nonconvex. Only the edges ac or bd are flippable.
IN PYTHON A tridiagonal matrix is one where the only nonzero elements are the ones on the main diagonal and the ones immediately above and below it.Write a function that solves a linear system whose coefficient matrix is tridiag- onal. In this case, Gauss elimination can be made much more efficient because most elements are already zero and don't need to be modified or added. As an example, consider a linear system Ax = b with 100,000 unknowns and the same number of equations. The coefficient matrix A is tridiagonal, with all elements on the main diagonal equal to 3 and all elements on the diagonals above and below it equal to 1. The vector of constant terms b contains all ones, except that the first and last elements are zero. You can use td to find that x1= −0.10557. The following code format should help: def td(l, m, u, b): '''Solve a linear system Ax = b where A is tridiagonal Inputs: l, lower diagonal of A, n-1 vector m, main diagonal of A, n vector u,…
Write a program in C: - Ask the user for the amount of diesel loaded in the submarine.- Asks the user for the magnitude (distance), in meters, and the heading, in degrees of thenavigation to way-point one.- Decompose the vector into x and y components and output the magnitude anddirection (North, West, South, or East are the only reliable headings on the sub’scompass) of the x component and then the y component. The x component is themagnitude multiplied by the cosine of the angle. The y component is the magnitudemultiplied by the sine of the angle. Determine compass direction depending on weatherthe vector component is positive or negative.- Calculate the amount of diesel spent to waypoint 1 and output it. Also output theamount of diesel remaining. (The submarine has a fuel capacity of 175 metric tons ofdiesel but was loaded with 1 ton in the example. The submarine spends 1 ton of dieselper 51 miles traveled.)- This step has to be repeated for another waypoint.- Ask the user for the…
Write a program in C: - Ask the user for the amount of diesel loaded in the submarine.- Asks the user for the magnitude (distance), in meters, and the heading, in degrees of thenavigation to way-point one.- Decompose the vector into x and y components and output the magnitude anddirection (North, West, South, or East are the only reliable headings on the sub’scompass) of the x component and then the y component. The x component is themagnitude multiplied by the cosine of the angle. The y component is the magnitudemultiplied by the sine of the angle. Determine compass direction depending on weatherthe vector component is positive or negative.- Calculate the amount of diesel spent to waypoint 1 and output it. Also output theamount of diesel remaining. (The submarine has a fuel capacity of 175 metric tons ofdiesel but was loaded with 1 ton in the example. The submarine spends 1 ton of dieselper 51 miles traveled.)- This step has to be repeated for another waypoint.- Ask the user for the…