Scribd Logo
Загрузить

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

  • Kruskal Algo

    Загружено:

    api-3844034
    68 просмотров1 страница
    Kruskal's Algorithm chooses edges in increasing order of length without worrying too much about their connection to previously chosen edges. The result is a forest of trees that grows until all the trees in a forest (all the components) merge in a single tree.

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

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

    © Attribution Non-Commercial (BY-NC)

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

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

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

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

    Пожаловаться на этот документ
    Kruskal's Algorithm chooses edges in increasing order of length without worrying too much about their connection to previously chosen edges. The result is a forest of trees that grows until all the trees in a forest (all the components) merge in a single tree.

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

    Attribution Non-Commercial (BY-NC)
    Скачайте в формате DOC, PDF, TXT или читайте онлайн в Scribd
    Отметить как неприемлемый контент
    68 просмотров1 страница

    Kruskal Algo

    Загружено:

    api-3844034
    Kruskal's Algorithm chooses edges in increasing order of length without worrying too much about their connection to previously chosen edges. The result is a forest of trees that grows until all the trees in a forest (all the components) merge in a single tree.

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

    Attribution Non-Commercial (BY-NC)
    Скачайте в формате DOC, PDF, TXT или читайте онлайн в Scribd
    Отметить как неприемлемый контент
    из 1

    Kruskal's Algorithm

    In kruskal's algorithm the selection function chooses edges in increasing order of


    length without worrying too much about their connection to previously chosen edges,
    except that never to form a cycle. The result is a forest of trees that grows until all the
    trees in a forest (all the components) merge in a single tree.

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