This ppt are showing the ds related questions and answers to understand the graph.
Size: 5.03 MB
Language: en
Added: Nov 01, 2025
Slides: 10 pages
Slide Content
GRAPH Concept , Type and Defination Presented by : Shah Khush - 12402040701090 (A-batch) Prajapati Khushi - 12402040701091 (B-batch)
Introduction to Graphs Graph is a non-linear data structure used to represent relationships between objects. Made up of vertices (nodes) and edges (links). Represented as G = (V, E), where V = set of vertices E = set of edges Used in: maps, networks, social media, routing, etc
Background Basic Terms in Graphs Vertex (Node): Represents an entity. Edge: Connects two vertices. Degree: Number of edges connected to a vertex. Path: Sequence of edges connecting vertices. Cycle: Path that starts and ends at the same vertex.
Directed & Undirected Graphs Directed Graph (Digraph): Edges have direction → one-way connection. Undirected Graph: No direction → two-way connection. Example: Directed: A → B → C Undirected: A—B—C
Weighted & Unweighted Graphs Weighted Graph: Each edge has a weight (cost, time, distance). Unweighted Graph: All edges are equal; no weights assigned. Used in shortest path algorithms (like Dijkstra’s).
Connected & Disconnected Graphs Connected Graph: Every vertex is reachable from every other vertex. Disconnected Graph: Some vertices are isolated or unreachable. Cyclic & Acyclic Graphs Cyclic Graph: Contains at least one closed path (cycle). Acyclic Graph: No cycles; example: Tree.
I ramped up VZJ's website design to make it more dynamic and user-friendly. Web Design for VZJ Co (June 2020) When KNJ Label rebranded, I helped to reflect that change in their website. Web Design for KNJ Label (July 2020) I collaborated with the new company The Plew to build their first website. Web Design for The Plew (September 2020) Graph Representation Adjacency Matrix: 2D array storing edge information. Adjacency List: Each vertex stores a list of connected vertices.
Applications : Social networks Google Maps & GPS Computer networks (routing) Web crawling Project management (CPM, PERT)