Tells you in linear time if two nodes are adjacent. More...
#include <ogdf/internal/energybased/AdjacencyOracle.h>
Public Member Functions | |
| AdjacencyOracle (const Graph &G) | |
| The one and only constrcutor for the class. | |
| ~AdjacencyOracle () | |
| This is the destructor. | |
| bool | adjacent (const node, const node) const |
| This returns true if the two nodes are adjacent in G, false otherwise. | |
Private Attributes | |
| Array2D< bool > * | m_adjacencyMatrix |
| A 2D-array where the entry is true if the nodes with the corresponding number are adjacent. | |
| NodeArray< int > | m_nodeNum |
| The internal number given to each node. | |
Tells you in linear time if two nodes are adjacent.
AdjacencyOracle is intialized with a Graph and returns for any pair of nodes in constant time if they are adajcent.
Definition at line 63 of file AdjacencyOracle.h.
| ogdf::AdjacencyOracle::AdjacencyOracle | ( | const Graph & | G | ) |
The one and only constrcutor for the class.
|
inline |
This is the destructor.
Definition at line 68 of file AdjacencyOracle.h.
This returns true if the two nodes are adjacent in G, false otherwise.
|
private |
A 2D-array where the entry is true if the nodes with the corresponding number are adjacent.
Definition at line 73 of file AdjacencyOracle.h.
|
private |
The internal number given to each node.
Definition at line 72 of file AdjacencyOracle.h.