A Topological Sorting Algorithm The basic algorithm for topological sorting is straightforward: 1. Locate a vertex with no successors. 2. Insert the vertex into the list of vertices. 3. Subtract the vertex from the graph. 4. Repetition Step 1 until all vertices have been deleted. Implement the algorithm by writing code.

A Topological Sorting Algorithm The basic algorithm for topological sorting is straightforward: 1. Locate a vertex with no successors. 2. Insert the vertex into the list of vertices. 3. Subtract the vertex from the graph. 4. Repetition Step 1 until all vertices have been deleted. Implement the algorithm by writing code.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter10: Classes And Data Abstraction

Section: Chapter Questions

Problem 23PE

See similar textbooks

Similar questions

Python Graph Algorithms: Minimum Spanning Trees Note: There are helper functions (see 'required' below), and some of them (like Kruskal's Algorithm, WeightedQuickUnion, and such) can help answering this problem. Problem: Suppose you are an engineer working on designing a road network for a new town. The town has many residential areas and commercial centers that need to be connected efficiently. You decided to represent the town as a connected, undirected graph where each vertex represents a location, and each edge represents a road connecting two locations. The weight of each edge represents the distance between the two locations. To ensure the road network is efficient, you need to find the minimum spanning tree of the graph. However, due to budget constraints, you can only construct roads with a maximum distance limit. You need to determine for how many pairs of locations, the minimum spanning tree of the graph remains the same when the maximum distance limit of a road is increased…
Python: Graph Colouring A simple method to find a colouring of a graph, with vertices {0,1,…,?−1}, is the following greedy algorithm: For ? in 0, 1, 2, ..., n - 1: Find the smallest colour (positive integer) ? which is not a colour of any neighbour of ?. Assign ? as the colour of ?. i) Implement the method above as a function greedy_colouring which takes a networkx Graph G (with vertices {0,1,…,?−1}) and returns a list C of the colours of G, where C[i] is the colour of vertex ?. ii) As a test, the Hoffman-Singleton graph (nx.hoffman_singleton_graph()) should require 6 colours using this method. If you have a graph G, you can draw it with coloured vertices using the code below: ten_colours = ['#CC6677', '#332288', '#DDCC77', '#117733', '#88CCEE', '#882255', '#44AA99', '#999933', '#AA4499', '#DDDDDD'] nx.draw_networkx(G, node_color=[ten_colours[i - 1] for i in greedy_colouring(G)], with_labels=False) iii) One way of refining the…
Searching and Sorting Sort a singly linked sequential list using bubble sort algorithm. Sort a singly linked sequential list using selection sort algorithm. Sort a DOUBLY linked sequential list using insertion sort algorithm. Implement binary search algorithm RECURSIVELY. Implement a recursive algorithm to find the n-th Fibonacci number using memoization.Instructions Complete the following methods on Searching and Sorting. You may use any language Java or Python to complete the tasks. If you are using JAVA, you must include the Tester class containing the main method which should test your other methods. If you are using PYTHON, make sure your code has the methods invoked through test statements. Usage of built in methods/libraries are NOT ALLOWED
1) Design an algorithm using DFS that detects whether graph G has a cycle. State and explain running time. Graph G need not be connected. Write in Pseudocode, please. 2) BFS refresher: Suppose you have an n × n chessboard and a knight placed in one of the squares. Youwould like to find out the fewest number of moves needed to reach a given target square. Design an algorithmfor this task stated formally below: Input: An n × n chess board, a starting square S, and a target square T.Output: The fewest number of moves a knight takes to move from S to T. Write in Pseudocode, please.
MazeSolver attempts to recursively traverse a Maze. The goal is to get from the * given starting position to the bottom right, following a path of 1’s. Arbitrary * constants are used to represent locations in the maze that have been TRIED * and that are part of the solution PATH.
Complete the task using the return search algorithm: Task: The labyrinth is represented by a Boolean square matrix A8x8. The cell (i, j) is considered passable if the element ai, j is true and otherwise impassable. Write a program that checks if there is a path from adjacent horizontally and vertically passable cells of the maze, which starts in its upper left corner (0.0) and ends in its lower right corner (7.7). Operating instructions: 1) Compose a Boolean function Path (i, j), called with initial parameters (0,0); 2) If cell (i, j) is outside the matrix Path returns false; 3) If cell (i, j) coincides with (7,7) a path is found and Path returns true; 4) If cell (i, j) is impassable Path returns false (because it cannot exit the cell), otherwise (if the cell is passable) there is a path from it to cell (7,7), if there is a path from any of the cells adjacent to (i, j) next to cell (7,7). Adjacent cells per cell (i, j) are cells (i + 1, j), (i, j + 1), (i-1, j), (i, j-1).
Artificial Intelligence - Local Search Starting from a randomly generated state of the 15-puzzle game, steepest-ascent hill-climbing (the vanilla version of hill-climbing search) gets stuck 76% of the time, i.e., solving only 24% of problem instances. But it works very quickly, i.e., it takes just 6 steps on average when it succeeds and 5 steps when it gets stuck. In contrast, if sideways moves are allowed, this raises the percentage of problem instances solved by hill-climbing from 24% to 81%, with the success at a cost: the algorithm averages roughly 7 steps for each successful instance and 32 steps for each failure. Now suppose that we are implementing random-restart hill climbing (i.e., if a search fails, it keeps to try, and try, until it gets a success) by the following two versions: one uses vanilla steepest-ascent hill climbing, and the other one uses hill climbing with sideways moves. Can you please tell which version of random-restart hill-climbing listed above runs faster…
Single source shortest path Algorithm 1. Implement the algorithm2. Write comments3. Screenshot of output /// Single source shortest path#include <stdio.h>#define INFINITY 9999void SingleSource(int graph[50][50], int qv, int start_ver);void main(){ int graph[50][50],qv, start_ver; int i,j; printf("\nEnter the quantity of vertexes:"); scanf("%d", &qv); printf("\nEnter the values for path costs matrix:\n"); for(i=0; i< qv; i++) for(j=0; j<qv; j++) scanf("%d", &graph[i][j]); printf("\nEnter the starting vertex:"); scanf("%d",&start_ver); SingleSource(graph, qv, start_ver); printf("\n\n\n"); return 0;}void SingleSource(int graph[50][50], int qv, int start_ver){ int eadgecost[50][50]; int distance[20]; int gen[50]; int visited[50]; int i,j; for(i=0; i<qv; i++) for(j=0; j<qv; j++) if (graph[i][j]==0) /// inserted single "=" instead of "=="…
Yusuf: C X 0 F1 umn.instructure.com/courses/342857/external_tools/retrieve?display=full_width&url=https%3A%2F%2Fumn.quiz-Iti-iad-prod.instructure.com ... D 2 L Given: Member m = new Board Member(); What will be printed by: System.out.println(m.toString()); ۲ 3 F2 W .. ص X Output: Searching A at: Searching C at: Searching X at: Searching Et: S >>> س eturn -1 if The BTNodeGen instance method search(T s) in the class above is intended to return the depth of the data items in the tree if it is found, and r item s is not found in the tree. Given the tree below, show the output that will be produced if the main() fragment were run, assuming the tree, t, is the followi ng: # 3 r L E 20 F3 $ 4 ی D уу. ي Without actually re-writing the code, briefly describe two changes needed to make search(T s) give the correct output. R W F L. G 000 900 F4 in with this one. thi Gill 5 ق 67 5⁰ "A" (depth 1) "B" "C" (depth 2) // (depth 3) "D" "E" % & ។ 7 V 8 28 Y.2⁰. AA F7 غ ز * H IJ X U .... o: W E A CSV B…
1. The algorithm SkipListSort is a sorting algorithm that begins by inserting a sequence of keys into a skip list. 1. Once you had done that, what would the remaining steps in the algorithm be? 2. Give an asymptotic notation that best describes how long it would take to sort n keys this way (i.e., the entire SkipListSort algorithm) and briefly explain (in a sentence or two) why. 2. The algorithm HashSort is a sorting algorithm that begins by inserting a sequence of keys into a hash table. 1. Once you had done that, what would the remaining steps in the algorithm be? 2. Give an asymptotic notation that best describes how long it would take to sort n keys this way (i.e., the entire HashSort algorithm) and briefly explain (in a sentence or two) why.
Breadth-first search must be done without recursion. (with iterative)
In computer science and mathematics, the Josephus Problem (or Josephus permutation) is a theoretical problem. Following is the problem statement: There are n people standing in a circle waiting to be executed. The counting out begins at some point (rear) in the circle and proceeds around the circle in a fixed direction. In each step, a certain number (k) of people are skipped and the next person is executed. The elimination proceeds around the circle (which is becoming smaller and smaller as the executed people are removed), until only the last person remains, who is given freedom. Given the total number of persons n and a number k which indicates that k-1 persons are skipped and kth person is killed in circle. The task is to choose the place in the initial circle so that you are the last one remaining and so survive. For example, if n = 5 and k = 2, then the safe position is 3. Firstly, the person at position 2 is killed, then person at position 4 is killed, then person at position 1…