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 i

Java - Write a program that removes all non alpha characters from the given input.

With Java, use single, two-way and multi-way if statements to write different kinds of loops that process Strings.

I need the code from start to end with no errors and the explanation for the code ObjectivesJava refresher (including file I/O)Use recursionDescriptionFor this project, you get to write a maze solver. A maze is a two dimensional array of chars. Walls are represented as '#'s and ' ' are empty squares. The maze entrance is always in the first row, second column (and will always be an empty square). There will be zero or more exits along the outside perimeter. To be considered an exit, it must be reachable from the entrance. The entrance is not an exit.Here are some example mazes:mazeA7 9# # ###### # #   ## # # #### #     ## ##### ##       ########## RequirementsWrite a MazeSolver class in Java. This program needs to prompt the user for a maze filename and then explore the maze. Display how many exits were found and the positions (not indices) of the valid exits. Your program can display the valid exits found in any order. See the examples below for exact output requirements. Also, record…

Design and implement a program that implements Euclid’s algorithm for finding the greatest common divisor of two positive integers. The greatest common divisor is the largest integer that divides both values without producing a remainder. In a class called DivisorCalc, define a static method called gcd that accepts two integers, num1 and num2. Create a driver to test your implementation. The recursive algorithm is defined as follows:gcd (num1, num2) is num2 if num2 <= num1 and num2evenly divides num1gcd (num1, num2) is gcd(num2, num1) if num1 < num2gcd (num1, num2) is gcd(num2, num1%num2) otherwise

Write a java program that uses an ArrayList object to store the following set of names in memory: [Steve, Tim, Lucy, Pat, Angela, Tom] Now write some more code so that the same ArrayList object is augmented with the name 'Steve' after the name 'Lucy' After the ArrayList object has been augmented with the new name, display the original and new lists on the console (as shown below), to verify that the new name is positioned correctly in the list.

JAVA Language:  Transpose Rotate.  Question:  Modify Transpose.encode() so that it uses a rotation instead of a reversal. That is, a word like “hello” should be encoded as “ohell” with a rotation of one character. (Hint: use a loop to append the letters into a new string)         import java.util.*;            public class TestTranspose {        public static void main(String[] args) {          String plain = "this is the secret message";   // Here's the message           Transpose transpose = new Transpose();          String secret = transpose.encrypt(plain);          System.out.println("\n ********* Transpose Cipher Encryption *********");          System.out.println("PlainText: " + plain);    // Display the results          System.out.println("Encrypted: " + secret);          System.out.println("Decrypted: " + transpose.decrypt(secret));// Decrypt        }      }            abstract class Cipher {        public String encrypt(String s) {          StringBuffer result = new…

This question was rejected because lack of a text file, which I do not see a way to upload. I saved the first part of the file as an image because that is all I can upload. If that doesn't suffice, please advise how to include a text file. In C++, I would like some help improving or making a better password lookup function for a Hash Table class/program I made,  The function:   it is supposed to lookup a user password using their ID and name which I read in from a text file. The one I have only works for the first 10 records, which I highlighted below in the program. string lookupPassword (string inUserID, string inUserName){ string thePassword; ... return thePassword; } Here is part of the program thus far: // Hash.cpp  #include <iostream>#include<string>#include<iomanip>#include<fstream>using namespace std;//node classclass nodeBST {private:    //user data    string userID;    string userName;    string userPW;    //BST left and right children    nodeBST*…

Use java and correctly indent code.

I have two questions: Is my programs code the most effective way at finding recursion or is there a much better and cleaner way? Why is the program showing 0 when I implement a number that depth is greater than 100? Shouldn't it show the number 1?   Source code: package recursiveModule; public class RecursiveMethod {    public static long calculateFactorial(int n, int depth) {        if (depth > 100 || n <= 1) {            return 1;        }                return n * calculateFactorial(n - 1, depth + 1);    }          public static void main(String[] args) {                             System.out.println("Factorial of 1 is " + RecursiveMethod.calculateFactorial(1, 0));                System.out.println("Factorial of 8 is " + RecursiveMethod.calculateFactorial(8, 0));                                      System.out.println("Factorial of 101 is " + RecursiveMethod.calculateFactorial(101, 0));                                   } }