23. All Spanning Trees of a connected graph with example

Поделиться
HTML-код
  • Опубликовано: 27 окт 2024

Комментарии • 22

  • @AkhilDixitKhatoBiscuit
    @AkhilDixitKhatoBiscuit 5 лет назад +2

    The presented algorithm does not compute all spanning trees of a graph. Please visit Knuth's book 'The Art of Computer Programming' volume 4A, fascicle 4, algorithm S for the correct algorithm.

  • @Amit00020
    @Amit00020 6 лет назад +1

    Good explanation & good voice

  • @asmayasin8369
    @asmayasin8369 3 года назад +1

    ❤❤❤❤

  • @domiboy5836
    @domiboy5836 6 лет назад +1

    Good explanation

  • @giri7016
    @giri7016 4 года назад +2

    Not only circuit may be cycle also

  • @eramir2719
    @eramir2719 4 года назад +1

    Thanku madam

  • @taemazed2594
    @taemazed2594 3 года назад

    Ma'am can u please explain shortly what cut set rank is ?

  • @vickysharma9227
    @vickysharma9227 4 года назад

    In 14:19 min, why you don't add f?
    Since, g,h,i is forming fundamental circuit right?
    So, you need to remove g?????

    • @itechnica
      @itechnica  4 года назад

      Hi! In T8 when we remove g & if we add f in that spanning tree it forms a cycle which is not possible.

    • @vickysharma9227
      @vickysharma9227 4 года назад

      @@itechnica Good Explanation.

  • @AdityaFingerstyle
    @AdityaFingerstyle 6 лет назад

    This is not the complete solution. This graph has 55 different spanning trees
    Take for example : Tree with edges (b,c,d,e,g). You missed that

    • @itechnica
      @itechnica  6 лет назад +2

      Hi! Yes, u r right. It depends how u choose arbitrary spanning tree.

    • @rahulgoyal59
      @rahulgoyal59 5 лет назад +1

      Another example - (b,c,d,g,h) is a spanning tree .In (b,c,d,e,g) make a cycle which is not a tree

  • @rajaadnansarwar9577
    @rajaadnansarwar9577 6 лет назад

    Good

  • @rahulpurkait8760
    @rahulpurkait8760 5 лет назад

    distance btw t8 &t9 is 2

    • @sandesh5981
      @sandesh5981 5 лет назад

      no its only one because she have said that the distance is measured on from i to j not from j to i.In j u see g which is not there in i but we don't consider it finding the distance between j to i.we only check distance from i to j that's why its only 1.

  • @meghnasingh9941
    @meghnasingh9941 5 лет назад +4

    You haven't even completed the question for total number trees possible , 1 dislike

  • @nihaltiwari2479
    @nihaltiwari2479 4 года назад

    Last tree has distance 3 not 2

    • @itechnica
      @itechnica  4 года назад

      Actually two edges i.e edge d & g which are present in T3 but not in T8.
      So d(T3,T8)=2

    • @nihaltiwari2479
      @nihaltiwari2479 4 года назад

      But you are forgetting edge e look carefully

    • @itechnica
      @itechnica  4 года назад

      @@nihaltiwari2479 we have to compare T3 Tree with T8 Tree.There are 5 edges in T3 i.e a,c,d,g,h.
      Egde d&g are not present in T8 Tree.

    • @nafiulakash5957
      @nafiulakash5957 4 года назад

      @@itechnica edge e kahaper giya mam in T8 e edge is present