Answered: Construct a function C(V) that counts…

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

Related questions

Question

5. Construct a function C(V) that counts the number of basic operations for the following algorithm. Then place the algorithm in a time efficiency class. State any assumptions you make. public static ArrayList topologicalSort(Graph dag) { Queue q = new LinkedList(); ArrayList sortOrder = new ArrayList(); int[] inEdgeCounts = new int[dag.size()]; for(int i = 0; i < inEdgeCounts.length; i++) { inEdgeCounts[i] = 0; } for(int i = 0; i < inEdgeCounts.length; i++) { dag.getAdjList(i).stream().forEach((x) -> inEdgeCounts[x]++); } // Identify sources for(int i = 0; i < inEdgeCounts.length; i++) { if(inEdgeCounts[i] == 0) { q.add(i); } } while(!q.isEmpty()) { int currVertex = q.remove(); sortOrder.add(currVertex); ArrayList adjList = dag.getAdjList(currVertex); // Remove edges for this node for(Integer adjVertex: adjList) { inEdgeCounts[adjVertex]--; if(inEdgeCounts[adjVertex] == 0) { q.add(adjVertex); } } } return sortOrder; }

Expert Solution

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions