equal
deleted
inserted
replaced
609 /// If the graph is directed, the algorithm consider it to be |
609 /// If the graph is directed, the algorithm consider it to be |
610 /// undirected by disregarding the direction of the edges. |
610 /// undirected by disregarding the direction of the edges. |
611 /// |
611 /// |
612 /// \param in This object is used to describe the edge costs. It can be one |
612 /// \param in This object is used to describe the edge costs. It can be one |
613 /// of the following choices. |
613 /// of the following choices. |
614 /// |
|
615 /// - An STL compatible 'Forward Container' with |
614 /// - An STL compatible 'Forward Container' with |
616 /// <tt>std::pair<GR::UEdge,X></tt> or |
615 /// <tt>std::pair<GR::UEdge,X></tt> or |
617 /// <tt>std::pair<GR::Edge,X></tt> as its <tt>value_type</tt>, where |
616 /// <tt>std::pair<GR::Edge,X></tt> as its <tt>value_type</tt>, where |
618 /// \c X is the type of the costs. The pairs indicates the edges |
617 /// \c X is the type of the costs. The pairs indicates the edges |
619 /// along with the assigned cost. <em>They must be in a |
618 /// along with the assigned cost. <em>They must be in a |