2. Write a program that implements an adjacency matrix for an undirected and unweighted graph. struct Node { int Vertex; Node* next; }; Implement the following functions. a. void printList (Node adjList[4]) b. //prints the vertices included in //an adjacency list c. Test your program output with graph G that has 4 vertices (1, 2, 3, and 4) and edges {(1,2), (1,4), (2,1), (2,3), (3,2), (4,1)}. Sample Run: adjacency Matrix: 1 2 3 4 1 (0) (1) (8) (1)] 2 (1)] (8] (11 (8) 3 (0] (1) (81 (0) 4 (1] (0] (0) (0] Adjacency List: k1, 2) <1, 4> <2, 1) (2, 3) (3, 2) <4, 1)

2. Write a program that implements an adjacency matrix for an undirected and unweighted graph. struct Node { int Vertex; Node* next; }; Implement the following functions. a. void printList (Node adjList[4]) b. //prints the vertices included in //an adjacency list c. Test your program output with graph G that has 4 vertices (1, 2, 3, and 4) and edges {(1,2), (1,4), (2,1), (2,3), (3,2), (4,1)}. Sample Run: adjacency Matrix: 1 2 3 4 1 (0) (1) (8) (1)] 2 (1)] (8] (11 (8) 3 (0] (1) (81 (0) 4 (1] (0] (0) (0] Adjacency List: k1, 2) <1, 4> <2, 1) (2, 3) (3, 2) <4, 1)

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

C++ A robot is initially located at position (0; 0) in a grid [?5; 5] [?5; 5]. The robot can move randomly in any of the directions: up, down, left, right. The robot can only move one step at a time. For each move, print the direction of the move and the current position of the robot. If the robot makes a circle, which means it moves back to the original place, print "Back to the origin!" to the console and stop the program. If it reaches the boundary of the grid, print \Hit the boundary!" to the console and stop the program. A successful run of your code may look like:Down (0,-1)Down (0,-2)Up (0,-1)Left (-1,-1)Left (-2,-1)Up (-2,0)Left (-3,0)Left (-4,0)Left (-5,0)Hit the boundary! or Left (-1,0)Down (-1,-1)Right (0,-1)Up (0,0)Back to the origin! About: This program is to give you practice using the control ow, the random number generator, and output formatting. You may use <iomanip> to format your output. You may NOT use #include "stdafx.h".
2D-DP-3 int getLowestFromArray(int myList[], int size) int i; int lowestIndex = 0; for (i = 1; i myList[i]) lowestIndex = i; return lowestIndex; int main() int cData[2][5] = {{12, 5, 4, 7, 8}, {6, 35, 3, 27, 8}}; int i, lowest; for (i = 0; i < 2; i++) lowest = printf("%d\n", lowest); return 0; Given the code segment above, what will be needed to complete the code above? Assume the necessary libraries and functions are included and implemented. Encoding Instructions: Write your answers with NO SPACES. Answers not accepted by automatic checking in AnimoSpace due to not complying with the encoding instructions will not be given considerations.
Subject-Object oriented programing Write a program which:• creates a new Array List• adds 5 decimal numbers to it• prints the list to the screenb) In the same program, insert an element in the above ArrayList at index 2. The resulting Array Listmust be one element larger. Print the resulting list to the screen.c) In the same program, replace the element in the ArrayList at index 2 by null. Print the resulting list tothe screen.d) In the same program, remove the element at the last index of the Array List. Print the resulting list tothe screen.e) In the same program, use a 'for' loop to print each element of the Array List to the screen.f) Create a class named ArrayListManager. Into this class, code a method which prints to the screenevery element of an Array List of strings placed at an odd index. Hint: use a modulus.
python assignment Matrix class Implement a matrix class (in matrix.py). a) The initializer should take a list of lists as an argument, where each outer list is a row, and each value in an inner list is a value in the corresponding row. b) Implement the __str__ method to nicely format the string representation of the matrix: one line per row, two characters per number (%2d) and a space between numbers. For example: m = Matrix([[1,0,0],[0,1,0],[0,0,1]]) print(m)> 1 0 0> 0 1 0> 0 0 1 c) Implement a method scale(factor) that returns a new matrix where each value is multiplied by scale. For example: m = Matrix([[1,2,3],[4,5,6],[7,8,9]])n = m.scale(2)print(n)> 2 4 6> 8 10 12>14 16 18print(m)> 1 2 3> 4 5 6> 7 8 9 d) Implement a method transpose() that returns a new matrix that has been transposed. Transposing flips a matrix over its diagonal: it switches rows and columns. m = Matrix([[1,2,3],[4,5,6],[7,8,9]])print(m)> 1 2 3> 4 5 6> 7 8…
Complete code asap. class Dijkstra(): """ A fully connected directed graph with edge weights """ def __init__(self, vertex_count): self.vertex_count = vertex_count self.graph = [[0 for _ in range(vertex_count)] for _ in range(vertex_count)] def min_distance(self, dist, min_dist_set): """ Find the vertex that is closest to the visited set """ min_dist = float("inf") for target in range(self.vertex_count): if min_dist_set[target]: continue if dist[target] < min_dist: min_dist = dist[target] min_index = target return min_index def dijkstra(self, src): """ Given a node, returns the shortest distance to every other node """ dist = [float("inf")] * self.vertex_count dist[src] = 0 min_dist_set = [False] * self.vertex_count for _ in range(self.vertex_count): #minimum distance vertex that…
Java programming language I have to create a remove method that removes the element at an index (ind) or space in an array and returns it. Thanks! I have to write the remove method in the code below. i attached the part where i need to write it. public class ourArrayList<T>{ private Node<T> Head = null; private Node<T> Tail = null; private int size = 0; //default constructor public ourArrayList() { Head = Tail = null; size = 0; } public int size() { return size; } public boolean isEmpty() { return (size == 0); } //implement the method add, that adds to the back of the list public void add(T e) { //HW TODO and TEST //create a node and assign e to the data of that node. Node<T> N = new Node<T>();//N.mData is null and N.next is null as well N.setsData(e); //chain the new node to the list //check if the list is empty, then deal with the special case if(this.isEmpty()) { //head and tail refer to N this.Head = this.Tail = N; size++; //return we are done.…
Subject-Object oriented programing Write a program which:• creates a new Array List• adds 5 decimal numbers to it• prints the list to the screen In the same program, replace the element in the ArrayList at index 2 by null. Print the resulting list tothe screen.
Write a program in c++ which should create a weighted graph of the values entered by the user andthen write functions that perform the following: 1. Depth first search of source and destination vertex2. Breadth first search of source and destination vertex3. Shortest path search of source and all destination vertices (Dijkstra’s algorithm)4. Shortest path search of source and destination vertex (Dijkstra’s algorithm) The program should present a menu of the options and should run until the user opts to quit.
A/ find code optimization method to this code and then find type to this code 1- For(i=1;i
Graph Applications Please help me debug this code, expected output is attached below #include <string>#include <vector>#include <iostream>#include <set>#include <map>#include <limits>#include <queue>template<typename T> class Graph;template<typename T>struct Edge{ size_t src; size_t dest; T weight; // To compare edges, only compare their weights, // and not the source/destination vertices inline bool operator< (const Edge<T>& e) const { return this->weight < e.weight; } inline bool operator> (const Edge<T>& e) const { return this->weight > e.weight; }};template <typename T>std::ostream& operator<<(std::ostream& os, const Graph<T>& G){ for (auto i = 1; i < G.vertices(); i++) { os << i << ":\t"; auto edges = G.outgoing_edges(i); for (auto& e : edges) os << "{" << e.dest << ": " << e.weight << "}, "; os <<…
] ] is_bipartite In the cell below, you are to write a function "is_bipartite (graph)" that takes in a graph as its input, and then determines whether or not the graph is bipartite. In other words, it returns True if it is, and False if it is not. After compiling the above cell, you should be able to compile the following cell and obtain the desired outputs. print (is_bipartite({"A" : ["B", "C"], "B" : ["A"], "C" : ["A"]}), is_bipartite({"A" : ["B", "C"], "B" : ["A", "C"], "C" : ["A", "B"]})) This should return True False Python Python
Write a recursive Java function displayOutIn that displays two items from an array list at one instance from out-to-in. until one or last two items displayed and the process stops. For example, given array A = {15, 74, 106, 10, 9, 86, 34} the displayOutIn function displays the following: 15, 34 74, 86 106, 9 10