blob: 2e4b5ba9a5571468d4b107afe17bc2c2aa4a2c19 (
plain)
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
|
/*
* vim: ts=4 sw=4 et tw=0 wm=0
*
* libavoid - Fast, Incremental, Object-avoiding Line Router
*
* Copyright (C) 2004-2008 Monash University
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
* See the file LICENSE.LGPL distributed with the library.
*
* Licensees holding a valid commercial license may use this file in
* accordance with the commercial license agreement provided with the
* library.
*
* This library 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.
*
* Author(s): Michael Wybrow
*/
#ifndef AVOID_MAKEPATH_H
#define AVOID_MAKEPATH_H
namespace Avoid {
class ConnRef;
class AStarPathPrivate;
class ANode;
class VertInf;
class AStarPath
{
public:
AStarPath();
~AStarPath();
void search(ConnRef *lineRef, VertInf *src, VertInf *tar,
VertInf *start);
private:
AStarPathPrivate *m_private;
};
}
#endif
|