# A note on two problems in connexion with graphs

We consider n points (nodes), some or all pairs of which are connected by a branch; the length of each branch is given. We restrict ourselves to the case where at least one path exists between any two nodes. We now consider two problems. Problem 1. Constrnct the tree of minimum total length between the n nodes. (A tree is a graph with one and only one path between every two nodes.) In the course of the construction that we present here, the branches are subdivided into three sets: I. the branches definitely assignec~ to the tree under construction (they will form a subtree) ; II. the branches from which the next branch to be added to set I, will be selected ; III. the remaining branches (rejected or not yet considered). The nodes are subdivided into two sets: A. the nodes connected by the branches of set I, B.

##### Relations

Computer science is the study of computation and information. Computer science deals with theory of c...

Edit details Edit relations Attach new author Attach new topic Attach new resource

##### from 0 reviews

- Resource level 0.0 /10
- beginner intermediate advanced
- Resource clarity 0.0 /10
- hardly clear sometimes unclear perfectly clear
- Reviewer's background 0.0 /10
- none basics intermediate advanced expert

##### Comments 0

*Currently, there aren't any comments.*