Scribd Logo
Загрузить

Добро пожаловать в Scribd!

  • Kruskal Algo

    Загружено:

    thakornikita001.nt10
    64 просмотров8 страниц
    The Kruskal algorithm finds the minimum cost spanning tree of a graph using a greedy approach. It treats the graph as a forest where each node starts in its own tree. The algorithm connects trees by adding the lowest cost edge that does not create a cycle, arranging the edges by cost and sequentially picking the cheapest available edge at each step. This continues until all the trees are connected into one minimum cost spanning tree.

    Исходное описание:

    Оригинальное название

    Kruskal algo PPT.pptx

    Авторское право

    © © All Rights Reserved

    Доступные форматы

    PPTX, PDF, TXT или читайте онлайн в Scribd

    Этот документ был вам полезен?

    Это неприемлемый материал?

    Пожаловаться на этот документ
    The Kruskal algorithm finds the minimum cost spanning tree of a graph using a greedy approach. It treats the graph as a forest where each node starts in its own tree. The algorithm connects trees by adding the lowest cost edge that does not create a cycle, arranging the edges by cost and sequentially picking the cheapest available edge at each step. This continues until all the trees are connected into one minimum cost spanning tree.

    Авторское право:

    © All Rights Reserved
    Скачайте в формате PPTX, PDF, TXT или читайте онлайн в Scribd
    Отметить как неприемлемый контент
    64 просмотров8 страниц

    Kruskal Algo

    Загружено:

    thakornikita001.nt10
    The Kruskal algorithm finds the minimum cost spanning tree of a graph using a greedy approach. It treats the graph as a forest where each node starts in its own tree. The algorithm connects trees by adding the lowest cost edge that does not create a cycle, arranging the edges by cost and sequentially picking the cheapest available edge at each step. This continues until all the trees are connected into one minimum cost spanning tree.

    Авторское право:

    © All Rights Reserved
    Скачайте в формате PPTX, PDF, TXT или читайте онлайн в Scribd
    Отметить как неприемлемый контент
    из 8

    Kruskal Algorithm

    • Kruskal Algorithm to find the minimum cost


    spanning tree uses the greedy approach

    • The algorithm treats the graph as a forest and


    every node has an individual tree
     Tree connect to another only and only if , it has
    the least cost among all available option and
    not violate MST properties.
    Example:
    • Step:1 arrange them in an ascending order of
    weightage (cost).

    • Step:2 Add the edge which has the


    least weightage
    The least cost is 2 and edges involved are B,D
    and D,T. We add them
    Next cost is 3, and associated edges are A,C
    and C,D. We add them again
    Next cost in the table is 4, and we observe that
    adding it will create a circuit in the graph.

    • Cost 5 and 6 also create circuits. We ignore


    them and move on.
    Between the two least cost edges available 7
    and 8, we shall add the edge with cost 7.

    Вам также может понравиться