|
template<typename V , typename E > |
using | dsac::graph::VertexList = std::list< typename Graph< V, E >::Vertex > |
| VertexList is a std::list of Vertex instances for Graph<V,E>
|
|
template<typename V , typename E > |
using | dsac::graph::EdgeList = std::list< typename Graph< V, E >::Edge > |
| EdgeList is a std::list of Edge instances for Graph<V,E>
|
|
template<typename V , typename E > |
using | dsac::graph::VertexSet = std::unordered_set< typename Graph< V, E >::Vertex, typename Graph< V, E >::VertexHash > |
| VertexSet is a std::unordered_set of Vertex instances for Graph<V,E>
|
|
template<typename V , typename E , typename T > |
using | dsac::graph::VertexMap = std::unordered_map< typename Graph< V, E >::Vertex, T, typename Graph< V, E >::VertexHash > |
| VertexMap is a std::unordered_map from Vertex to type T for Graph<V,E>
|
|
template<typename V , typename E > |
using | dsac::graph::VertexIntMap = VertexMap< V, E, int > |
| VertexIntMap is a std::unordered_map from Vertex to int for Graph<V,E>
|
|
template<typename V , typename E > |
using | dsac::graph::VertexVertexMap = VertexMap< V, E, typename Graph< V, E >::Vertex > |
| VertexVertexMap is a std::unordered_map from Vertex to Vertex for Graph<V,E>
|
|
template<typename V , typename E > |
using | dsac::graph::VertexEdge = VertexMap< V, E, typename Graph< V, E >::Edge > |
| VertexEdgeMap is a std::unordered_map from Vertex to Edge for Graph<V,E>
|
|