/usr/include/vtk-7.1/vtkBoostDividedEdgeBundling.h is in libvtk7-dev 7.1.1+dfsg1-2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 | /*=========================================================================
Program: Visualization Toolkit
Module: vtkBoostDividedEdgeBundling.h
Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen
All rights reserved.
See Copyright.txt or http://www.kitware.com/Copyright.htm for details.
This software is distributed WITHOUT ANY WARRANTY; without even
the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
PURPOSE. See the above copyright notice for more information.
=========================================================================*/
/*-------------------------------------------------------------------------
Copyright 2008 Sandia Corporation.
Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation,
the U.S. Government retains certain rights in this software.
-------------------------------------------------------------------------*/
/**
* @class vtkBoostDividedEdgeBundling
* @brief layout graph edges in directed edge bundles
*
*
* Uses the technique by Selassie, Heller, and Heer to route graph edges into directed
* bundles, with "lanes" for bundled edges moving in each direction. This technique
* works best for networks whose vertices have been positioned already (geospatial
* graphs, for example). Note that this scales to a few thousand edges in a reasonable
* period of time (~1 minute). The time complexity comes mainly from the doubling
* of edge control points each cycle and the complex set of forces between many pairs of
* edge points.
*
* The algorithm depends on the Boost graph library for its implementation of all-pairs
* shortest paths, needed here for determining connectivity compatibility.
*
* @par Thanks:
* This algorithm was developed in the paper:
* David Selassie, Brandon Heller, Jeffrey Heer. Divided Edge Bundling for Directional
* Network Data. Proceedings of IEEE InfoVis 2011.
*/
#ifndef vtkBoostDividedEdgeBundling_h
#define vtkBoostDividedEdgeBundling_h
#include "vtkInfovisBoostGraphAlgorithmsModule.h" // For export macro
#include "vtkDirectedGraphAlgorithm.h"
class VTKINFOVISBOOSTGRAPHALGORITHMS_EXPORT vtkBoostDividedEdgeBundling : public vtkDirectedGraphAlgorithm
{
public:
static vtkBoostDividedEdgeBundling *New();
vtkTypeMacro(vtkBoostDividedEdgeBundling,vtkDirectedGraphAlgorithm);
void PrintSelf(ostream& os, vtkIndent indent);
protected:
vtkBoostDividedEdgeBundling();
~vtkBoostDividedEdgeBundling() {}
int RequestData(vtkInformation *, vtkInformationVector **, vtkInformationVector *);
private:
vtkBoostDividedEdgeBundling(const vtkBoostDividedEdgeBundling&) VTK_DELETE_FUNCTION;
void operator=(const vtkBoostDividedEdgeBundling&) VTK_DELETE_FUNCTION;
};
#endif
|