|
| template<class SourcePair > |
| void | dijkstra (SourcePair &pair) |
| | Implementation of dijkstra's algorithm.
|
| |
|
template<> |
| void | dijkstra (double &)=delete |
| |
|
template<> |
| void | dijkstra (void *&)=delete |
| |
|
template<> |
| void | dijkstra (char *&)=delete |
| |
|
template<> |
| void | dijkstra (int &)=delete |
| |
|
template<typename It , class Pred > |
| Pred | find (It begin, It end, Pred) |
| |
|
template<typename It , class Pred > |
| Pred | find_if (It begin, It end, Pred) |
| |
|
template<typename It , class Pred > |
| Pred::size_type | erase (It begin, It end, Pred) |
| |
|
template<typename It , class Pred > |
| Pred::size_type | erase_if (It begin, It end, Pred) |
| |
AMLALE: SourcePair desrves documentation by themselves.