You can plot shapes in Python using line graphs in matplot lib by providing the coordinates of the vertices of the shapes as x, y pairs and using the matplotlib.pyplot.plot (i.e. plt.plot) function. Draw a triangle, square, pentagon, hexagon and heptagon. Note: Use symmetry, starting with the origin at (0,0), and set the distance from the origin to the vertex to be of length 1.0 (otherwise this becomes very complicated for some shapes).

Undirected graph is given with the list of edges. Build an adjacency matrix. Print the number of ones in adjacency matrix. Graph can contain multiple edges and loops. Input First line contains number of vertices n. Each of the next line contains one edge. Read the edges till the end of file. Output Build an adjacency matrix. Print the number of ones in adjacency matrix. Sample input 3 1 2 23 22 32 Sample output 5

to build a graph. First, we need to build a list of the vertices in the graph. Write code for a small graph that consists of four vertices:

Using the graph in the question: Write Java code to create an Adjacency Matrix M to represent the graph. Write Java code to create an Adjacency List L to represent the graph.

Develop a Java program to represent the following weighted graph as Adjacency matrix. Input all the vertices and edges of the Graph and print the Adjacency matrix. 5.5 (5 10.27 6. 20 4 10 20.15 1 15 10 10 3 20 2 15 8. 15 15, 10 10 20

Write a program (WAP) to create an undirected graph using adjacency matrix representation.Number of nodes and edges should be taken from the user. After creating the graph, performfollowing operations: (i) Search a node. Take the node number from the user. If the node is found then print its associatededges.(ii) Insert a node in the graph.(iii) Insert an edge in the graph. Take the node numbers from the user between which the edge is tobe inserted.(iv) Delete a node from the graph. Take the node number to be deleted from the user.(v) Apply DFS on the graph and print the graph traversal.(vi) Apply BFS on the graph and print the graph traversal.Solve the above problem using adjacency list representation.

I. Write/modify MATLAB code and create a properly labeled graph. Add 2 additional lines to your plot, “Cannon Range”, for v3 = 25 m/s and v4= 75 m/s..

Our main objective is to implement breadth-first-search (BFS) to print the vertices of a graph G. To get the full grade, you must annotate your code (i.e., write relevant comments throughout your program) and proceed as follows: Ask the user to enter the number of nodes of a graph G. Ask the user to enter the edges of G (e.g., if the user enters 3 and 5; it means that there is an edge between nodes 3 and 5). Store the graph G using an adjacency matrix. Run BFS on G, starting form node 1 (i.e., we assume here that the start node is 1). Use a queue to implement BFS. You may use the queue class from the library of the programming language you are using (so there is no need to implement your own class queue). Write a main function to test your program, and make sure BFS is visiting the vertices of G as expected.

Computer Science For an image represented by a given large 3d numpy array, use numpy to get a neighborhood filter using the mean of the pixels. For example, look through each of the image’s 3×3 window of pixels and replace outlier pixels with the mean value of the others in the 3×3 window. Set the resulting pixel value to be the mean value of a pixel and its eight neighbors. For pixels on an edge, use the mean value of the pixel and its five neighbors. For pixels on corners, use the mean value of the pixel and its three neighbors. If you loop over every pixel then you must store your input and output arrays separately