REQUIREMENTS:

Must submit a C$++$ program that compiles on the CSE CELL Machines.

Failure to provide such will result in a ZERO for your final grade $($No Partial Credit$)$

Must cite any external resources used in a Header Comment in the appropriate file$($s$).$

Failure to provide external resources results in a $50\%$ reduction in your final grade.

Main.cpp: driver code

Each functionality must have their own function.Each section is marked accordingly.

$$

Graph.cpp$/.$h

Adjacency List MUST BE PRESENTEach functionality must have it's own function.Each section is marked accordingly.

$$

Additional Object Declarations are optional, but must be in their own $.$cpp and $.$h files.

For example $($not limited to$)$:

Vector.cpp$/.$hEdge.cpp$/.$h

$$

$1.$ Create an Adjacency List inside a Graph class from User Input. $(10$ Points$)$

Example Prompt:

How many Vertices are in this Graph? $($Non$-$Negative Values$)$

$25$

For Vertex $0$: who are their Neighbors? $(-1$ stops inquiry$)$

$10$

$21$

$13$

$15$

$0$

$-1$

For Vertex $1$: who are their Neighbors? $(-1$ stops inquiry$)$

$.$

$.$

$.$

$.$

Other supporting Data Structures are permitted, but the Adjacency List inside a Graph Object$/$Class is REQUIRED! $(0\%$ no partial credit$)$

This functionality can be inside the Graph.cpp file, but must be inside a separate function.

Failure to do this will result in at most HALF credit for this feature.

$$

$2.$ Print the Adjacency List to the screen. $(10$ POINTS$)$

Example Prompt for a Graph of $5$ Vertices:

$0$: $234$

$1$: $124$

$2$: $014$

$3$: $034$

$4$: $0123$

This functionality can be inside the Graph or Main $.$cpp files, but must be inside a separate function.

Failure to do this will result in at most $50\%$ credit for this feature.

$$

$3.$ Prompt the user for a walk from v$0$ to vL and test if the provided walk is valid. $(40$ POINTS$)$

Example Prompt:

Input walk sequence of alternating vertices that starts and ends with a vertex: $(-1$ stops input$)$

$1$

$2$

$3$

$4$

$-1$

WALK NOT VALID!

Input walk sequence of alternating vertices that starts and ends with a vertex: $(-1$ stops input$)$

$3$

$0$

$4$

$1$

$2$

$0$

$-1$

WALK IS VALID!

This functionality can be inside the Graph or Main $.$cpp files, but must be inside a separate function.

Failure to do this will result in at most HALF credit for this feature.

$$

$4.$ Test and Prompt valid Walk Sequence Properties: $(40$ POINTS$)$

Open$/$Closed

Trail$$

Path$$

Circuit

Cycle

Example Prompt:

The Walk Sequence has the following properties:

OPEN

TRAIL

This functionality can be inside the Graph or Main $.$cpp files, but must be inside a separate function.

Failure to do this will result in at most HALF credit for this feature. $1.$ Create an Adjacency List inside a Graph class from User Input. $(10$ Points$)$

Example Prompt:

How many Vertices are in this Graph? $($Non$-$Negative Values$)$

$25$

For Vertex $0$ : who are their Neighbors? $(-1$ stops inquiry$)$

$10$

$21$

$15$

$0$

$-1$

For Vertex $1$: who are their Neighbors? $(-1$ stops inquiry$)$

Other supporting Data Structures are permitted, but the Adjacency List inside a Graph Object$/$Class is REQUIRED! $(0\backslash \%$ no partial credit$).$

This functionality can be inside the Graph.cpp file, but must be inside a separate function.

Failure to do this will result in at most HALF credit for this feature.

$2.$ Print the Adjacency List to the screen. $(10$ POINTS$)$

Example Prompt for a Graph of $5$ Vertices:

$0$: $234$

$1$: $124$

$2$: $014$

$3$: $034$

$4$: $0123$

This functionality can be inside the Graph or Main $.$cpp files, but must be inside a separate function.

Failure to do this will result in at most $\backslash (50\backslash \%\backslash )$ credit for this feature. $3.$ Prompt the user for a walk from v$0$ to vL and test if the provided walk is valid. $(40$ POINTS$)$

Example Prompt:

$```$

Input walk sequence of alternating vertices that starts and ends with a vertex: $(-1$ stops input$)$

$1$

$2$

$4$

$-1$

WALK NOT VALID!

Input walk sequence of alternating vertices that starts and ends with a vertex: $(-1$ stops input$)$

$\backslash$

$4$

$1$

$2$

$-1$

WALK IS VALID!

$```$

This functionality can be inside the Graph or Main $.$cpp files, but must be inside a separate function.

Failure to do this will result in at most HALF credit for this feature. $4.$ Test and Prompt valid Walk Sequence Properties: $(40$ POINTS$)$

$-$ Open$/$Closed

$-$ Trail

$-$ Path

$-$ Circuit

$-$ Cycle

Example Prompt:

The Walk Sequence $\backslash (\backslash$langle $3,0,4,1,2,0>\backslash )$ has the following properties:

OPEN

TRAIL

This functionality can be inside the Graph or Main $.$cpp files, but must be inside a separate function.

Failure to do this will result in at most HALF credit for this feature.