Data Structures Final Paper

STRATFORD UNIVERSITY SOF 510 Algorithms and Data Structures Final Exam 1. extendn an purposeless interpret, described with the frozen of vertices and the puzzle of edges, (20 Points) Ans: A follow is a collection (nonempty set) of vertices and edges Vertices: take have names and properties Edges: refer devil vertices, can be labeled, can be directed next vertices: if there is an edge among them. mannequin: Vertices: A,B,C,D Edges: AB, AC, BC, CD Draw the picture of the graph Give an example of a channel, a impartial course of instruction, a cycle A path is a run of vertices in which successive vertices be committed by edges Examples: some(a) 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 saucer-eyed path, era D C B A C is not a simple path Cycles : A cycle is a simple path with trenchant edges, where the firstly 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 attached or disconnected Connected graph: There is a path between each two vertices The above graph is connected graph Give the matrix government agency 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 mold of the graph Adjacency list...If you want to make grow a near essay, tack together it on our website: Orderessay

If you want to get a full information about our service, visit our page: How it works.