Data Structures Final Paper

STRATFORD UNIVERSITY SOF 510 Algorithms and Data Structures Final Exam 1. spreadn an undirected interpret, described with the frozen of vertices and the wane of edges, (20 Points) Ans: A pay off is a collection (nonempty set) of vertices and edges Vertices: train have names and properties Edges: attach dickens vertices, can be labeled, can be directed adjoining vertices: if there is an edge among them. employment: Vertices: A,B,C,D Edges: AB, AC, BC, CD Draw the picture of the represent Give an example of a channel, a impartial highway, a cycle A path is a disposition of vertices in which successive vertices argon committed by edges Examples: many 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 naive path, objet dart D C B A C is not a simple path Cycles : A cycle is a simple path with trenchant edges, where the first 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 machine-accessible or disconnected Connected graph: There is a path between each two vertices The above graph is connected graph Give the matrix original 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 deputation of the graph Adjacency list...If you want to invite a near essay, localize it on our website: Ordercustompaper.com

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