This is the prim's algorithm (to find the minimum spanning tree) implimentation in php.
In the view there is three option. You can upload txt file of adjacent matrix in which the nodes are separated with tab delimitter.
and enter the number of nodes and click in process button. It will show the result in another page.
Another option is, If you want to see the step by step minimum vertice.
And you can see that the result is also written in a txt file which is in the project root folder like named: Result_of_Graph_G_N_10.txt
The sample Adjacent matrix txt file is in the /uploads directory. You can see them as well as.