Data Structures Final Paper

STRATFORD UNIVERSITY SOF 510 Algorithms and Data Structures Final Exam 1. put upn an undirected interpret, described with the frozen of vertices and the watch of edges, (20 Points) Ans: A behave is a collection (nonempty set) of vertices and edges Vertices: butt joint have names and properties Edges: charge devil vertices, can be labeled, can be directed conterminous vertices: if there is an edge among them. fount: Vertices: A,B,C,D Edges: AB, AC, BC, CD Draw the picture of the represent Give an example of a channel, a impartial form, a cycle A path is a make of vertices in which successive vertices atomic number 18 attached by edges Examples: nigh paths in Graph : A B C D A C B A C D A B D C B C B A Simple path: No vertex is repeated. Examples: In Graph, D C B A is a unproblematic path, darn D C B A C is not a simple path Cycles : A cycle is a simple path with trenchant edges, where the source vertex is equal to the last.

Examples: Cycles in Graph: C A B C, C B A C, A B C A, A C B A, B A C B, B C A B A B A is not a cycle, because the edge A B is the same as B A Determine whether the graph is affiliated or disconnected Connected graph: There is a path between each two vertices The above graph is connected graph Give the matrix copy of the graph Vertices: A,B,C,D Edges: AB, AC, BD, CD | |A |B |C |D | |A |0 |1 |1 |0 | |B |1 |0 |0 |1 | |C |1 |0 |0 |1 | |D |0 |1 |1 |0 | Give the contiguousness lists bureau of the graph Adjacency list...If you want to work a near essay, parliamentary procedure it on our website: Ordercustompaper.com

If you want to get a full essay, wisit our page: write my paper