1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
|
/*
* $Revision: 3931 $
*
* last checkin:
* $Author: beyer $
* $Date: 2014-02-20 14:56:42 +0100 (Thu, 20 Feb 2014) $
***************************************************************/
/** \file
* \brief Declares class AdjacencyOracle.
*
* \author Rene Weiskircher
*
* \par License:
* This file is part of the Open Graph Drawing Framework (OGDF).
*
* \par
* Copyright (C)<br>
* See README.txt in the root directory of the OGDF installation for details.
*
* \par
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* Version 2 or 3 as published by the Free Software Foundation;
* see the file LICENSE.txt included in the packaging of this file
* for details.
*
* \par
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* \par
* You should have received a copy of the GNU General Public
* License along with this program; if not, write to the Free
* Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
* Boston, MA 02110-1301, USA.
*
* \see http://www.gnu.org/copyleft/gpl.html
***************************************************************/
#ifdef _MSC_VER
#pragma once
#endif
#ifndef OGDF_ADJACENCY_ORACLE_H
#define OGDF_ADJACENCY_ORACLE_H
#include <ogdf/basic/NodeArray.h>
#include <ogdf/basic/Array2D.h>
namespace ogdf {
//! Tells you in constant time if two nodes are adjacent
/**
* AdjacencyOracle is initialized with a Graph and returns for
* any pair of nodes in constant time if they are adajcent.
*/
class AdjacencyOracle {
public:
//! The constructor for the class, needs time O(n + m)
AdjacencyOracle(const Graph &G);
//! The destructor
~AdjacencyOracle() { }
//! This returns true if the two nodes are adjacent in G, false otherwise
bool adjacent(const node, const node) const;
private:
NodeArray<int> m_nodeNum; //!< The internal number given to each node
Array2D<bool> m_adjacencyMatrix; //!< A 2D-array where the entry is true if the nodes with the corresponding number are adjacent
};
}
#endif
|
