Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

AdjacencyOracle.h
Go to the documentation of this file.
1 
32 #pragma once
33 
34 #include <ogdf/basic/NodeArray.h>
35 
36 namespace ogdf {
37 
39 
46 public:
53  explicit AdjacencyOracle(const Graph& G, int degreeThreshold = 32);
54 
57 
59  bool adjacent(node v, node w) const;
60 
61 private:
63  int index(node v, node w) const;
64 
66  std::vector<bool> m_adjacencies;
67 };
68 
69 }
ogdf
The namespace for all OGDF objects.
Definition: AugmentationModule.h:36
ogdf::AdjacencyOracle::m_adjacencies
std::vector< bool > m_adjacencies
An entry is true iff the corresponding nodes are adjacent.
Definition: AdjacencyOracle.h:66
ogdf::internal::GraphRegisteredArray
RegisteredArray for nodes, edges and adjEntries of a graph.
Definition: Graph_d.h:651
ogdf::Graph
Data type for general directed graphs (adjacency list representation).
Definition: Graph_d.h:862
ogdf::AdjacencyOracle::~AdjacencyOracle
~AdjacencyOracle()
The destructor.
Definition: AdjacencyOracle.h:56
NodeArray.h
Declaration and implementation of NodeArray class.
OGDF_EXPORT
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF DLL.
Definition: config.h:101
ogdf::AdjacencyOracle::m_nodeNum
NodeArray< int > m_nodeNum
The internal number given to each node.
Definition: AdjacencyOracle.h:65
ogdf::AdjacencyOracle
Tells you in constant time if two nodes are adjacent.
Definition: AdjacencyOracle.h:45
ogdf::NodeElement
Class for the representation of nodes.
Definition: Graph_d.h:233