6 * $Date: 2012-07-07 17:14:54 +0200 (Sa, 07. Jul 2012) $
7 ***************************************************************/
10 * \brief Implementation of class WSPD (well-separated pair decomposition).
12 * \author Martin Gronemann
15 * This file is part of the Open Graph Drawing Framework (OGDF).
19 * See README.txt in the root directory of the OGDF installation for details.
22 * This program is free software; you can redistribute it and/or
23 * modify it under the terms of the GNU General Public License
24 * Version 2 or 3 as published by the Free Software Foundation;
25 * see the file LICENSE.txt included in the packaging of this file
29 * This program is distributed in the hope that it will be useful,
30 * but WITHOUT ANY WARRANTY; without even the implied warranty of
31 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
32 * GNU General Public License for more details.
35 * You should have received a copy of the GNU General Public
36 * License along with this program; if not, write to the Free
37 * Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
38 * Boston, MA 02110-1301, USA.
40 * \see http://www.gnu.org/copyleft/gpl.html
41 ***************************************************************/
44 #include "FastUtils.h"
48 WSPD::WSPD(__uint32 maxNumNodes
) : m_maxNumNodes(maxNumNodes
)
50 m_maxNumPairs
= maxNumNodes
*2;
63 unsigned long WSPD::sizeInBytes() const
65 return m_maxNumNodes
*sizeof(WSPDNodeInfo
) +
66 m_maxNumPairs
*sizeof(WSPDPairInfo
);
72 m_nodeInfo
= (WSPDNodeInfo
*)MALLOC_16(m_maxNumNodes
*sizeof(WSPDNodeInfo
));
73 m_pairs
= (WSPDPairInfo
*)MALLOC_16(m_maxNumPairs
*sizeof(WSPDPairInfo
));
77 void WSPD::deallocate()
86 for (__uint32 i
= 0; i
< m_maxNumNodes
; i
++)
88 m_nodeInfo
[i
].numWSNodes
= 0;
93 } // end of namespace ogdf