Explain Network '' minimum spanning tree""

 The minimum spanning tree links all node point or vertices of the network with the minimum length of all  arcs. In this procedure find the minimum  spanning tree of a network using greedy algorithm. If the network are not connected the solution, called a minimum spanning forest is a combination of minimum spanning trees formed on the connected subsets.

But the algorithm is used in application such as transportation networks like computer networks and water networks when the tree connecting all node must have minimum length.

Math '' How to work our transferable of network "

The Konigsberg bridge problem 

The seven bridges of Konigsberg is a historically notable problem in mathematics. its negative resolution by Leonhard Euler in 1736 laid the foundation of the graph. 

The problem it was that could you travel across all seven bridges if Konigsberg without going through the same bridge twice.

What is the transferable network?

A transferable network  is a network where you can draw a single line across the network  while going over each part only once. This is a very simple concept to grasp but it also raises the question of how do you determine if the network is transferable or not.

The way of determining if the network is transferable or not is by the amount of the paths that connected to each node. You simply need to see if the network has 2 odd or not. What ac odd node is sims up to a node that has an odd number of paths connected to it . If the network has more than 2 of these kind of nodes then it is considered not a transferable network.

     Leonhard Euler

Leonhard Euler was a swiss mathematician, physicist, astronomer, geographer, logician and engineer who made important and influential discoveries in many branches of mathematics, he is the one who figured out the Konigsberg theory.