#include <hypergraph.h>
|
| static constexpr int | Size |
| |
◆ complex_edges
| std::vector<unsigned> hypergraph::Node::complex_edges |
◆ padding
| char hypergraph::Node::padding[std::max< int >(1, 64 - Size)] |
|
private |
◆ simple_edges
| std::vector<unsigned> hypergraph::Node::simple_edges |
◆ simple_neighborhood
| NodeMap hypergraph::Node::simple_neighborhood = 0 |
◆ Size
| constexpr int hypergraph::Node::Size |
|
staticconstexprprivate |
Initial value:=
sizeof(std::vector<unsigned>) * 2 +
sizeof(
NodeMap)
uint64_t NodeMap
Since our graphs can never have more than 61 tables, node sets and edge lists are implemented using 6...
Definition: node_map.h:40
The documentation for this struct was generated from the following file: