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/Graph.h>
35 #include <ogdf/basic/basic.h>
36 
37 #include <vector>
38 
39 namespace ogdf {
40 
42 
49 public:
56  explicit AdjacencyOracle(const Graph& G, int degreeThreshold = 32);
57 
60 
62  bool adjacent(node v, node w) const;
63 
64 private:
66  int index(node v, node w) const;
67 
69  std::vector<bool> m_adjacencies;
70 };
71 
72 }
ogdf
The namespace for all OGDF objects.
Definition: multilevelmixer.cpp:39
Graph.h
Includes declaration of graph class.
ogdf::AdjacencyOracle::m_adjacencies
std::vector< bool > m_adjacencies
An entry is true iff the corresponding nodes are adjacent.
Definition: AdjacencyOracle.h:69
ogdf::internal::GraphRegisteredArray
RegisteredArray for nodes, edges and adjEntries of a graph.
Definition: Graph_d.h:658
ogdf::Graph
Data type for general directed graphs (adjacency list representation).
Definition: Graph_d.h:869
ogdf::AdjacencyOracle::~AdjacencyOracle
~AdjacencyOracle()
The destructor.
Definition: AdjacencyOracle.h:59
basic.h
Basic declarations, included by all source files.
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:68
ogdf::AdjacencyOracle
Tells you in constant time if two nodes are adjacent.
Definition: AdjacencyOracle.h:48
ogdf::NodeElement
Class for the representation of nodes.
Definition: Graph_d.h:240