Depth First Numbering
Not what you're looking for?
Apply the depth-first search algorithm to the graph (in the attachment) to find the depth-first search numbering. Then color the tree edges (blue for example) and the back edges (black for example). Now assign directions to all the edges. You may start from any point on the graph.
Is the resulting graph strongly connected?
See the attached file.
Purchase this Solution
Solution Summary
Since the used Depth First Numbering algorithm requires traversing neighbor nodes of a node in some order (in the order these appear in adjacency list), the ordering in adjacency list will effect the final outcome.
Solution Preview
Please refer to http://www.csee.ogi.edu/class/cs532/13.pdf for more information on Depth First Numbering algorithm used in this response. Each node is labeled in a/b format where a can be taken as the depth first number of that node.
Tree edges have been colored thick green and back edges have been retained as thin black lines. Since original graph is an undirected graph, every edge in it can either be a tree ...
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.
Excel Introductory Quiz
This quiz tests your knowledge of basics of MS-Excel.
C# variables and classes
This quiz contains questions about C# classes and variables.
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.
Inserting and deleting in a linked list
This quiz tests your understanding of how to insert and delete elements in a linked list. Understanding of the use of linked lists, and the related performance aspects, is an important fundamental skill of computer science data structures.