Scribd Logo
Upload

Welcome to Scribd!

  • CSE

    Uploaded by

    vaibhav bakshi
    5 views1 page
    1. The document discusses representations of graphs and the time complexities of different representations. 2. It describes adjacency matrix and adjacency list representations of graphs. Adjacency matrix uses an array to represent edges, while adjacency list uses arrays of linked lists. 3. Adjacency matrix has a worst-case time complexity of O(V^2) for operations like insertion and removal of edges. Adjacency list has a worst-case time complexity of O(E+V) where E is the number of edges and V is the number of vertices.

    Original Description:

    CSE

    Copyright

    © © All Rights Reserved

    Available Formats

    TXT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    1. The document discusses representations of graphs and the time complexities of different representations. 2. It describes adjacency matrix and adjacency list representations of graphs. Adjacency matrix uses an array to represent edges, while adjacency list uses arrays of linked lists. 3. Adjacency matrix has a worst-case time complexity of O(V^2) for operations like insertion and removal of edges. Adjacency list has a worst-case time complexity of O(E+V) where E is the number of edges and V is the number of vertices.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    5 views1 page

    CSE

    Uploaded by

    vaibhav bakshi
    1. The document discusses representations of graphs and the time complexities of different representations. 2. It describes adjacency matrix and adjacency list representations of graphs. Adjacency matrix uses an array to represent edges, while adjacency list uses arrays of linked lists. 3. Adjacency matrix has a worst-case time complexity of O(V^2) for operations like insertion and removal of edges. Adjacency list has a worst-case time complexity of O(E+V) where E is the number of edges and V is the number of vertices.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    <!

    DOCTYPE html>
    <html lang="en">
    <head> <meta charset="utf-8">
    <title> </title>
    <style>
    *{margin: 0;padding: 0;}
    .main{width: 900px;margin: auto;}
    .topic{margin: 20px 0;box-shadow: 0 2px 5px 0 rgba(0,0,0,0.2);border-radius:
    6px;}
    .t1 {padding: 10px;}
    .topic img{
    max-width: 100%;
    }
    .pbImageToTextHint{display: none;}
    .t2 li{list-style: none;border: 1px solid #ccc;}
    .answer-given-body p img{
    width: auto !important;height: auto!important;max-width: 100% !
    important;
    }
    .hidden {visibility:hidden; }
    </style>
    </head>
    <body>
    <div class="main"> <h2> Question:<span class="title"></span></h2> <div
    class="topic t1"> <div class="pbImages"><img
    src="https://media.cheggcdn.com/media/e27/e27bf83d-c03b-418d-9f23-ea5b39451f29/
    phpMig5HT" /> </div> </div> <div class="topic t2"><p>&nbsp;</p>
    <p>Step 1</p> <p>Defined the given graph statements of correct graph
    representation</p> <p>Step 2</p> <p>1.a.Adjacency matrix:-Each vertex has at most
    three edges incident on it,the predominant operation used are 1.inserting an edge
    2.removing an edge 3.traversal and these and these operations are used equally
    often.While Adjacency list defines a graph as an array of linked lists.The index of
    the array defined a vertex and every element in its linked list expressed the
    different vertices which form an edge to the vertex.Array of edges&nbsp; is a list
    or array of every the edges in a graph. Edge array are one of the simplest
    expressions of a graph.</p> <p>2.O(V^2):-worst-case time complexity of adjacency
    matrix.While adjacency list has O(E+V) where E is the total number of edges and V
    is the total number of vertices.</p></div></div></html>

    You might also like