equal
deleted
inserted
replaced
134 ///%Prim algorithm class to find a minimum spanning tree. |
134 ///%Prim algorithm class to find a minimum spanning tree. |
135 |
135 |
136 /// \ingroup spantree |
136 /// \ingroup spantree |
137 ///This class provides an efficient implementation of %Prim algorithm. |
137 ///This class provides an efficient implementation of %Prim algorithm. |
138 /// |
138 /// |
139 ///The running time is O(e*log n) where e is the number of edges and |
139 ///The running time is \f$ O(e\log(n)) \f$ where e is the number of edges and |
140 ///n is the number of nodes in the graph. |
140 ///n is the number of nodes in the graph. |
141 /// |
141 /// |
142 ///The edge costs are passed to the algorithm using a |
142 ///The edge costs are passed to the algorithm using a |
143 ///\ref concept::ReadMap "ReadMap", |
143 ///\ref concept::ReadMap "ReadMap", |
144 ///so it is easy to change it to any kind of cost. |
144 ///so it is easy to change it to any kind of cost. |