32 void add(
int end1,
int end2,
int val);
33 void set(
int end1,
int end2,
int val);
34 void erase(
int end1,
int end2);
36 std::vector<Graph::Edge>
get_all();
38 int get_val(
int end1,
int end2);
int get_val(int end1, int end2)
Get the val for an edge.
Definition: edgehash.cpp:92
Header for classes/structures/functions to work with graphs.
Hash map for node pairs representing edges.
Definition: edgehash.hpp:24
std::vector< Graph::Edge > get_all()
Get a vector of all the edges.
Definition: edgehash.cpp:70
void clear()
Clear all the edges from the hash.
Definition: edgehash.cpp:90
Definition: edgehash.cpp:18
void erase(int end1, int end2)
Delete a pair.
Definition: edgehash.cpp:65
EdgeHash(int size)
An EdgeHash for approximately size elements.
Definition: edgehash.cpp:36
Utility functions, macros, and structures.
std::unique_ptr< eh_impl > eh_pimpl
The hash table implementation.
Definition: edgehash.hpp:42
EdgeHash & operator=(const EdgeHash &eh)=delete
No copy assign.
The namespace for this project.
Definition: abc_nodesel.hpp:20
void add(int end1, int end2, int val)
Add a pair.
Definition: edgehash.cpp:47