Write a program ErdosRenyiGraph that takes integer values V and E from the command line and builds a graph by generating E random pairs of integers between 0 and V1. Note: This generator produces self-loops and parallel edges.

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.

The implementations of the methods addAll, removeAll, retainAll, retainAll, containsAll(), and toArray(T[]) are omitted in the MyList interface. Implement these methods.   Use the template at https://liveexample.pearsoncmg.com/test/Exercise24_01_13e.txt to implement these methods this the code i have for the write your own code part  import java.util.Iterator; interface MyList<E> extends java.util.Collection<E> {    void add(int index, E e);    boolean contains(Object e);    E get(int index);    int indexOf(Object e);    int lastIndexOf(E e);    E remove(int index);    E set(int index, E e);    void clear();    boolean isEmpty();    Iterator<E> iterator();    boolean containsAll(java.util.Collection<?> c);    boolean addAll(java.util.Collection<? extends E> c);    boolean removeAll(java.util.Collection<?> c);    boolean retainAll(java.util.Collection<?> c);    Object[] toArray();    <T> T[] toArray(T[] a);    int size();} and its…

import java.util.HashMap; import java.util.Map; public class LinearSearchMap {     // Define a method that takes in a map and a target value as parameters     public static boolean linearSearch(Map<String, Integer> map, int target) {         // Iterate through each entry in the map         for () {             // Check if the value of the current entry is equal to the target             if () {                 // If the value is equal to the target, return true             }         }         // If no entry with the target value is found, return false     }     public static void main(String[] args) {         // Create a HashMap of strings and integers         Map<String, Integer> numbers = new HashMap<>();         // Populate the HashMap with key-value pairs         numbers.put("One", 1);         numbers.put("Two", 2);         numbers.put("Three", 3);         numbers.put("Four", 4);         numbers.put("Five", 5);         // Set the target value to search for…

Write a class MySortedArrayCollection that Inherit the SortedArrayCollection class show in screen shot and such that all the following methods are implemented in java, then write a driver program to test the methods public String toString() // Creates and returns a string that correctly represents the current collection. public T smallest() // Returns null if the collection is empty, otherwise returns the smallest element of the collection. public int greater(T element)  // Returns a count of the number of elements e in the collection that are greater then element, that is such that e.compareTo(element) is > 0 public MySortedArrayCollection <T> combine (MySortedArrayCollection<T>other)  // Creates and returns a new SortedArrayCollection object that is a combination of this object and the argument object. public T []toArray() // Returns an array containing all of the elements of the collection. public void clear() // Removes all elements. public boolean equals(Object o)…

Please help with the program below. Need to write a program called dfs-stack.py in python that uses the algorithm below without an agency list but instead uses an adjacency matrix. The program should prompt the user for the number of vertices V, in the graph.Please read the directions below I will post a picture of the instructions and the algorithm.

Please help me figure this question out

We were given the following code to solve a Pentomino puzzle, several methods might need to be added or editted to solve the problem. The program should take in an input of 3 4 5 6 for 3x20 4x15 5x12 6x10 grids. Then output the number of correct solutions for them (respectively its 2, 368, 1010, and 2339) import java.util.ArrayList;import java.util.LinkedList;import java.util.List; public class DLX {    class DataNode {        DataNode L, R, U, D;        ColumnNode C;                public DataNode() {            L = R = U = D = this;        }         public DataNode(ColumnNode c) {            this();            C = c;        }        DataNode linkDown(DataNode node) {            node.D = this.D;            node.D.U = node;            node.U = this;            this.D = node;            return node;        }        DataNode linkRight(DataNode node) {            node.R = this.R;            node.R.L = node;            node.L = this;            this.R = node;            return node;…

In Java, import TreeMap

1. Given a Vertex object x, give Java code to enumerate its outgoing edges. ("Enumerate" means "to list"; your code does not need to do anything with the edges, but should be setup code that would make it easy to do something with each edge if we wanted to add that in.) 2. Given a VertexAndDist object x and a new distance d, give Java code to create an updated object with the same vertex as x but with distance d. 3. For simplicity of implementation, we use HashMaps to map vertices to handles/parents and edges to weights. How could you modify the Vertex and/or Edge classes, as well as the maps themselves, to implement the maps using ordinary arrays, with no hashing? Be sure to address both the vertex and edge maps in your answer. (Hint: consider the Vertex's "id" field for inspiration.)