Adaptagrams
hola.h
1 /*
2  * vim: ts=4 sw=4 et tw=0 wm=0
3  *
4  * libdialect - A library for computing DiAlEcT layouts:
5  * D = Decompose/Distribute
6  * A = Arrange
7  * E = Expand/Emend
8  * T = Transform
9  *
10  * Copyright (C) 2018 Monash University
11  *
12  * This library is free software; you can redistribute it and/or
13  * modify it under the terms of the GNU Lesser General Public
14  * License as published by the Free Software Foundation; either
15  * version 2.1 of the License, or (at your option) any later version.
16  * See the file LICENSE.LGPL distributed with the library.
17  *
18  * This library is distributed in the hope that it will be useful,
19  * but WITHOUT ANY WARRANTY; without even the implied warranty of
20  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
21  *
22  * Author(s): Steve Kieffer <http://skieffer.info>
23 */
24 
25 #ifndef DIALECT_HOLA_H
26 #define DIALECT_HOLA_H
27 
28 #include <string>
29 #include <vector>
30 
31 #include "libdialect/commontypes.h"
32 #include "libdialect/opts.h"
33 #include "libdialect/logging.h"
34 
35 namespace dialect {
36 
46 void doHOLA(dialect::Graph &G, const dialect::HolaOpts &holaOpts, dialect::Logger *logger = nullptr);
47 
51 void doHOLA(dialect::Graph &G);
52 
53 
54 } // namespace dialect
55 
56 #endif // DIALECT_HOLA_H
The Graph class represents graphs consisting of nodes and edges.
Definition: graphs.h:180
libdialect: A library for computing human-like orthogonal network (DiAlEcT) layouts.
Definition: cola.h:44
void doHOLA(dialect::Graph &G, const dialect::HolaOpts &holaOpts, dialect::Logger *logger=nullptr)
Apply the HOLA layout algorithm to the given Graph. See Steve Kieffer, Tim Dwyer, Kim Marriott...
Definition: hola.cpp:59