Purchase Solution

Topological Sorting

Not what you're looking for?

Ask Custom Question

An algorithm for computing a topological ordering of a DAG (Directed Acyclic Graph) repeatedly finds a node with no incoming edges and deletes it. This will eventually produce a topological ordering, provided that the input graph really is a DAG.

But suppose that we're given an arbitrary graph that may or may not be a DAG. Extend the topological ordering algorithm so that given an input directed graph G it outputs one of two things: (a) a topological ordering, thus establishing that G is a DAG; or (b) a cycle in G, and
thus establishing that G is not a DAG. The running time of your algorithm should be O(m+n) for a directed graph with n nodes and medges.

Purchase this Solution
Solution Summary

The expert examines topological sorting algorithm for computing.

Purchase this Solution
Free BrainMass Quizzes
Word 2010: Tables

Have you never worked with Tables in Word 2010? Maybe it has been a while since you have used a Table in Word and you need to brush up on your skills. Several keywords and popular options are discussed as you go through this quiz.

C# variables and classes

This quiz contains questions about C# classes and variables.

Javscript Basics

Quiz on basics of javascript programming language.

Basic Computer Terms

We use many basic terms like bit, pixel in our usual conversations about computers. Are we aware of what these mean? This little quiz is an attempt towards discovering that.

C++ Operators

This quiz tests a student's knowledge about C++ operators.

View More Free Quizzes
Related BrainMass Solutions

  • BFS, DFS, DAGs, Topological sorting, and Dijkstra

    The desired topological sorting is the reverse postorder of these searches.

  • Topological Space : Subspace

    32378 Topological Space : Subspace Let X be a topological space and let Y be a subset of X. Check that the so-called subspace topology is indeed a topology on Y. Definition of Topological Space: Suppose X is any non-empty set.

  • Topology : Past Exam Paper

    (a) Define a homomorphism between topological spaces X and Y. Define what is meant by a topological invariant. (b) State what it means for a map f X -?> Y to be open. Show that a continuous open bijection is a homomorphism.

  • Interior of a set in a topological subspace

    348256 Interior of a set in a topological subspace Let Y be a subspace of X and let A be a subset of Y. Denote by Int_X(A) the interior of A in the topological space X and by Int_Y(A) the interior of A in the topological space Y.

  • Real Analysis

    243812 Real Analysis: Topological Spaces In the textbook: Topological spaces 1.Compactness in Metric spaces (Sections 11.1-11.4) Problems: - Section 11 --# 1,2,3,4 2.Real functions on Metric and Topological Spaces (Sections 12.1.12.2

  • Topological proof

    Let Y be a topological space... The solution is attached. The solution provides an example of completing a proof regarding a topological space.

  • Topology : Subspace

    ., (Y,J) is a topological space. For proof, please see the attachment. Topological subspaces are investigated. The solution is detailed and well presented.

  • Topological Space : Subspace

    32271 Topological Space : Subspace 19. Let X be a topological space and let Y be a subset of X. Check that the so-called subspace topology is indeed a topology of Y.

  • Countable collections

    Content: Topological and metric spaces, continuity, subspaces, products and quotient topology, compactness and connectedness, extension theorems, topological groups, topological and differentiable manifolds, tangent spaces, vector fields, submanifolds

View More Related Solutions