Write a program to find the number of connected components and cyles applying DFS or write a program to find the shortest path of a graph whose edges have been assigned weights.

Solution PreviewSolution Preview

This material may consist of step-by-step explanations on how to solve a problem or examples of proper writing, including the use of citations, references, bibliographies, and formatting. This material is made available for the sole purpose of studying and learning - misuse is strictly forbidden.

#include <cstdlib>
#include "Graph.h"
using namespace std;

bool cycles=false;// determine if a graph has cycles.
bool * Visited;
node * headnodes;

void DFS(int v)
    //cout<<v<<" ";
    if (Visited [v]==true) {

   // cout<<v<<" ";
    Visited [v]=true;
    node * adjnode = headnodes[v].next;
    while (adjnode != 0 ) // visit all vertices adjacent to v
       if (!Visited[adjnode->vertex]) //if adjacent vertex to v was not visited previously
       else if (v == adjnode->vertex) {
            cycles = true;
       adjnode = adjnode->next;

By purchasing this solution you'll be able to access the following files:

50% discount

$25.00 $12.50
for this solution

or FREE if you
register a new account!

PayPal, G Pay, ApplePay, Amazon Pay, and all major credit cards accepted.

Find A Tutor

View available C-Family Programming Tutors

Get College Homework Help.

Are you sure you don't want to upload any files?

Fast tutor response requires as much info as possible.

Upload a file
Continue without uploading

We couldn't find that subject.
Please select the best match from the list below.

We'll send you an email right away. If it's not in your inbox, check your spam folder.

  • 1
  • 2
  • 3
Live Chats