C++ Data Structures and Algorithm Design Principles by John Carey Shreyans Doshi & Payas Rajan

Author:John Carey, Shreyans Doshi & Payas Rajan
Language: eng
Format: epub
Publisher: Packt Publishing Pvt. Ltd.
Published: 2019-10-30T16:00:00+00:00

The following figures illustrate the working of the preceding algorithm:

Figure 6.17: Initialization

Figure 6.18: Since vertex 1 was assigned blue, we color vertex 2 red

Figure 6.19: Since vertex 2 was colored red, we color vertex 8 blue.

As can be observed from the preceding set of figures, the algorithm zigzags through the graph, assigning alternate colors to each vertex that's visited. If all the vertices can be colored this way, the graph is bipartite. If DFS reaches two vertices that have already been assigned the same color, the graph can be safely declared to be not bipartite.

Using the graph in figure 6.17 as input, your final output should look as follows:

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.