MHB Prim's algorithm for minimal spanning tree

Thread starter LearnerJr
Start date Nov 20, 2016
Tags

Algorithm Tree

AI Thread Summary

Prim's algorithm is a method for finding the minimum spanning tree of a connected, undirected graph. To implement the algorithm, start with a single vertex and repeatedly add the smallest edge connecting a vertex in the tree to a vertex outside the tree until all vertices are included. Documentation of each step can include noting the vertices added, the edges selected, and the current state of the tree after each addition. The algorithm can still be applied to any connected graph, ensuring that it maintains the properties of a spanning tree. Understanding the definition of a connected spanning subgraph is crucial for correctly applying Prim's algorithm.

Nov 20, 2016

LearnerJr

Quite stuck on this how do i do this and how do i document each step?

Physics news on Phys.org

Nov 20, 2016

Prove It

Gold Member

MHB

LearnerJr said:

Quite stuck on this how do i do this and how do i document each step?

https://en.wikipedia.org/wiki/Prim's_algorithm

Nov 20, 2016

LearnerJr

Prove It said:

https://en.wikipedia.org/wiki/Prim's_algorithm

It says connected spanning subgraph. I am so confused . can I still use normal prim algorithm ??

Thread 'Formal derivation of statement from Peano Arithmetic system'

I was reading a Bachelor thesis on Peano Arithmetic (PA). PA has the following axioms (not including the induction schema): $$\begin{align} & (A1) ~~~~ \forall x \neg (x + 1 = 0) \nonumber \\ & (A2) ~~~~ \forall xy (x + 1 =y + 1 \to x = y) \nonumber \\ & (A3) ~~~~ \forall x (x + 0 = x) \nonumber \\ & (A4) ~~~~ \forall xy (x + (y +1) = (x + y ) + 1) \nonumber \\ & (A5) ~~~~ \forall x (x \cdot 0 = 0) \nonumber \\ & (A6) ~~~~ \forall xy (x \cdot (y + 1) = (x \cdot y) + x) \nonumber...

View full post »