Create a graph using networkx of CT towns that are within the red circle. For each town, output the shortest path to Fairfield. You can use networkx to get the shortest path. Output the number of cities using networkx Output the number of edges using networkx Submit python file or a jupyter notebook with all the code.

write a java program. a. Write a program to do DFS topological sort. your program must be able to catch the loop. Run the program on the attached graph. b. Write a program to do BFS topological sort. your program must be able to catch the loop. Run the program on the attached graph. the graph is in the attachment. m Show Transcribed Text Z P..

Using Python

Solve using JAVA only   Given a square chess board of size N, solve the N queens problem. Print out the number of solutions for a given N. You do not need to print out or produce the actual solutions, only the number of correct solutions. Solve for N between 2 and 8. Try your program with 9 and 10, produce those results if it returns in a reasonable amount of time.   The N queens problem is to find every configuration of N queens distributed on an NxN square chess board such that all queens are safe from attack by each other.

implement a python code that is a filesystem using a tree data structure. If the specific path does not exist, disregard that file using the code template given in this pastebin link: https://pastebin.com/NuPaPAFT The input format is as follows, the first line is the name of the root directory second line is the number of subdirectories that follows For the next files that follows, the format is: Filename-root node,next path,next path,... Please note the output format.   Sample input 1: C12Users-CWindows-CProgramFiles-CAdobe-C,ProgramFilesSteam-C,ProgramFilesferdie-C,Usersjohn-C,Usersguest-C,UsersFirmware-C,WindowsSystem-C,WindowsDocuments-C,Users,ferdieDownloads-C,Users,ferdie   Output: C    Users        ferdie            Documents            Downloads        john        guest    Windows        Firmware        System    ProgramFiles        Adobe        Steam

Please answer this question- Implement Floyd's algorithm for the Shortest Path on your system, and study its performance using different graphs. Side note- Below I have attached Floyd's Algorithm for Shortest Paths. please use java language for coding java file - should start with your Last Name, Like SmithClubApp, PetrowskiTravelLogApp, for your class short paragraph should include- please label the question with the answer as well -description of the java file -what it does? -what is the input data? expected output, samples of both

Read the question in the picture first and then solve the question please. def readFile():    # reading file from as input    # change the file name according to yours    f = open("graph.txt", "r")        # first line of input contains the number of vertices in the graph    n = f.readline()    # strip() gets rid of the new line    # try printing n without strip()    print(n.strip())    n = n.strip()    print(type(n))    # n is of type string. we need to convert it to int    n=int(n)    print(type(n))        # the second line of the file contains the number of connections    c = f.readline()    c = c.strip()    c = int(c)    print(c)        buildGraphUsingDictionary(c,f)        buildGraphUsingListofLists(c,f)   # we want to build an adjacency list like the following# A -> B,C # One vertex can be connected to multiple vertices# which means multiple values are associated with one vertex# one data structure that can be used is a dictionary of lists# {A:[B,C]} def…

Solve using JAVA only   Given a square chess board of size N, solve the N queens problem. ONLY Print out the NUMBER of solutions for a given N. DO NOT print out or produce the actual solutions, the code shold ONLY PROVIDE the number of correct solutions. Solve for N between 2 and 8. Try your program with 9 and 10, produce those results if it returns in a reasonable amount of time. The N queens problem is to find every configuration of N queens distributed on an NxN square chess board such that all queens are safe from attack by each other.

Given a set of n types of rectangular 3-D boxes, where the ith box has height hi, width wi and depth di (all real numbers). Create a stack of boxes which is as tall as possible, but you can only stack a box on top of another box if the dimensions of the 2-D base of the lower box are each strictly larger than those of the 2-D base of the higher box. It is possible to rotate a box so that any side functions as its base. It is also allowable to use multiple instances of the same type of box. Precisely define the subproblem.Provide the recurrence equation.Describe the algorithm in pseudocode to compute the optimal value.Describe the algorithm in pseudocode to print out an optimal solution.

Please, can you help me? Thanks I'm working with notebook python. In the code cell below, create and populate an instance of a weighted graph to represent the following locations and distances between them:   town hall library bus station cinema town hall - 10 14 30 library 10 - 8 23 bus station 14 8 - 37 cinema 30 23 37 - Draw the graph using the draw method. Note that you must copy files m269_digraph.py and m269_ungraph.py to the folder with this TMA notebook.   %run -i m269_digraph%run -i m269_ungraph%matplotlib inline