dsac::graph::Graph< V, E >::EdgeHash Struct Reference

Hash functor that allows use of Edge as an unordered set/map key. More...

#include <graph.h>

Collaboration diagram for dsac::graph::Graph< V, E >::EdgeHash:

Public Member Functions
size_t	operator() (Edge e) const

Detailed Description

template<typename V, typename E>
struct dsac::graph::Graph< V, E >::EdgeHash

Hash functor that allows use of Edge as an unordered set/map key.

Member Function Documentation

operator()()

template<typename V , typename E >

size_t dsac::graph::Graph< V, E >::EdgeHash::operator() ( Edge  e ) const

inline

Here is the call graph for this function:

---

The documentation for this struct was generated from the following file:

• dsac/graph/graph.h