Prim Algorithm

How does it run?

• Choose an arbitrary vertex $v$ and let $S=\{v\}$
• Choose a vertex $u$ closest to $S$ and add it into $S$ and record the corresponding edge
• go on until all vertices are in $S$
• The recorded edges and $S$ constructs a Minimum Spanning Tree

Let $G=(V,E,W)$ be a weithted connected graph and has $n$ vertices.

一些常用的函数:

int socket(int domain, int type, int protocol);

domain可选值:

Introduction

This is bold text, and this is emphasized text.

Test for Equations

This is an inline equation: $a+b=?$

This is a display equation:

Test for Code Block