Graph Data Structure | Part 4 | Adjacency List Representation and Operations

Поділитися
Вставка
  • Опубліковано 8 лис 2024

КОМЕНТАРІ • 10

  • @jjoelthomas
    @jjoelthomas 10 місяців тому +2

    Hi @10:23, you call the constructor like G=new AdjacencyListGraph(4), whereas the constructor you show is the default constructor with no arguments. Can you please clarify this.

    • @nikoo28
      @nikoo28  10 місяців тому +2

      So sorry for that. It should just be
      G=new AdjacencyListGraph( );

    • @mrcoder9401
      @mrcoder9401 4 місяці тому

      @@nikoo28 No worries, I just want to thank you for the awesome content Nikhil
      that Parametrized Contrustor is not an issue if someone wan'ts to focus on the main topic. Its common sense.

  • @AKumar-p9f
    @AKumar-p9f Місяць тому

    Great explanation as usual. You are making what seemed daunting topics to be understood easily. Your approach of taking things one at a time is really helping us to understand the topic easily!

  • @plaksh1
    @plaksh1 5 місяців тому +1

    Thank you for your clear and simple explanations -they've been incredibly helpful!

    • @nikoo28
      @nikoo28  5 місяців тому +1

      Glad it was helpful!

  • @droid-aman
    @droid-aman 5 місяців тому +1

    your way of presentation and teaching is 🔥🔥🔥

    • @nikoo28
      @nikoo28  5 місяців тому

      Thanks a lot 😊

  • @amadzarak7746
    @amadzarak7746 4 місяці тому

    Subscribed. Thank u brother

  • @sumitmalpure944
    @sumitmalpure944 18 днів тому

    Degree of 4 is wrong then as per linked list?