Tài liệu Thư viện số

Danh mục TaiLieu.VN

 » Từ khóa: greedy choice

Kết quả 1-1 trong khoảng 1

  • Minimum Spanning Tree

    Minimum Spanning Tree

    Given a connected, undirected graph, a spanning tree of that graph is a subgraph that is a tree and connects all the vertices together. A single graph can have many different spanning trees. We can also assign a weight to each edge, which is a number representing how unfavorable it is, and use this to assign a weight to a spanning tree by computing the sum of the weights of the edges in that spanning tree.

     97 p pdu 01/08/2012 59 1

    Từ khóa: minimum spanning tree, DFS spanning tree, greedy choice, prim slection rule, prim algorithm, build tree

Đăng nhập

Hướng dẫn khai thác thư viện số

Bộ sưu tập nổi bật

Tin nhanh

@tag greedy choice/p_school_code=16/p_filetype=/p_intCateID1=/p_intCateID2=/p_intStart=0/p_intLimit=12/host=10.20.1.100/port=9315/_index=libdocuments,libdocumentsnew