Connection


1   /*
2    * Copyright (C) Jakub Neubauer, 2007
3    *
4    * This file is part of TaskBlocks
5    *
6    * TaskBlocks is free software; you can redistribute it and/or modify
7    * it under the terms of the GNU General Public License as published by
8    * the Free Software Foundation; either version 3 of the License, or
9    * (at your option) any later version.
10   *
11   * TaskBlocks is distributed in the hope that it will be useful,
12   * but WITHOUT ANY WARRANTY; without even the implied warranty of
13   * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
14   * GNU General Public License for more details.
15   *
16   * You should have received a copy of the GNU General Public License
17   * along with this program.  If not, see <http://www.gnu.org/licenses/>.
18   */
19  
20  package taskblocks.graph;
21  
22  import java.awt.Polygon  ;
23  
24  /**
25   * Representation of dependency connection in graph.
26   */
27  class Connection extends GraphObject {
28  
29      /** Source task */
30      Task _fromTask;
31      
32      /** Target task */
33      Task _toTask;
34      
35      Polygon   _path;
36      
37      /**
38       * Says how long is the connection line padded from the tasks  boundary.
39       * Thanks to padding connections don't cross each other.
40       * Padding says just the count of skips, not absolute distance. When rendering,
41       * this number is multiplied by some factor.
42       * Negative value means padding is in the top direction, positive value means direction
43       * to bottom.
44       */
45      int _padding;
46      
47      public Connection(Task from, Task to) {
48          _fromTask = from;
49          _toTask = to;
50          _path = new Polygon  (new int[4], new int[4], 4);
51      }
52  }
53
A to Z: JavaDoc & Examples Daily Java News & Articles Open Source Projects Open Source Codes Free Computer Books Remove Frame
Popular Tags