Program in C /Java that performs a DFS(depth first search)

Anonymous
timer Asked: Mar 30th, 2016

Question description

  • Write a program in C++/Java that performs a DFS on following graph and ouputs edges with labels, tree edge, back edge, forward edge and cross edge.Submit your program and screen shot of outputs in a single word/pdf file.

    Your program should accept following file as an input. You have to write code to process this input. You should define and use adjacency list representation of graph.

    The input in the file is in this format:

    First line is number of nodes.

    Rest of lines are in this format: node number (node degree) : adjacency list

file:

11

0  (4) : 1 6 8 10

1  (3) : 0 2 3

2  (5) : 1 3 4 5 6

3  (2) : 1 2

4  (2) : 2 5

5  (2) : 2 4

6  (3) : 0 2 7

7  (1) : 6

8  (2) : 0 9

9  (1) : 8

10 (1) : 0

Tutor Answer

(Top Tutor) Studypool Tutor
School: New York University
Studypool has helped 1,244,100 students
flag Report DMCA
Similar Questions
Hot Questions
Related Tags

Brown University





1271 Tutors

California Institute of Technology




2131 Tutors

Carnegie Mellon University




982 Tutors

Columbia University





1256 Tutors

Dartmouth University





2113 Tutors

Emory University





2279 Tutors

Harvard University





599 Tutors

Massachusetts Institute of Technology



2319 Tutors

New York University





1645 Tutors

Notre Dam University





1911 Tutors

Oklahoma University





2122 Tutors

Pennsylvania State University





932 Tutors

Princeton University





1211 Tutors

Stanford University





983 Tutors

University of California





1282 Tutors

Oxford University





123 Tutors

Yale University





2325 Tutors