/usr/include/vtk-7.1/vtkTulipReader.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 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 | /*=========================================================================
Program: Visualization Toolkit
Module: vtkTulipReader.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 vtkTulipReader
* @brief Reads tulip graph files.
*
*
* vtkTulipReader reads in files in the Tulip format.
* Definition of the Tulip file format can be found online at:
* http://tulip.labri.fr/tlpformat.php
* An example is the following
* <code>
* (nodes 0 1 2 3 4 5 6 7 8 9)
* (edge 0 0 1)
* (edge 1 1 2)
* (edge 2 2 3)
* (edge 3 3 4)
* (edge 4 4 5)
* (edge 5 5 6)
* (edge 6 6 7)
* (edge 7 7 8)
* (edge 8 8 9)
* (edge 9 9 0)
* (edge 10 0 5)
* (edge 11 2 7)
* (edge 12 4 9)
* </code>
* where "nodes" defines all the nodes ids in the graph, and "edge"
* is a triple of edge id, source vertex id, and target vertex id.
* The graph is read in as undirected graph. Pedigree ids are set on the output
* graph's vertices and edges that match the node and edge ids defined in the
* Tulip file.
*
* Clusters are output as a vtkAnnotationLayers on output port 1. Each cluster
* name is used to create an annotation layer, and each cluster with that name
* is added to the layer as a vtkSelectionNode. Nesting hierarchies are treated
* as if they were flat. See vtkGraphAnnotationLayersFilter for an example of
* how the clusters can be represented visually.
*
* @attention
* Only string, int, and double properties are supported. Display information
* is discarded.
*
* @par Thanks:
* Thanks to Colin Myers, University of Leeds for extending this implementation.
*/
#ifndef vtkTulipReader_h
#define vtkTulipReader_h
#include "vtkIOInfovisModule.h" // For export macro
#include "vtkUndirectedGraphAlgorithm.h"
class VTKIOINFOVIS_EXPORT vtkTulipReader : public vtkUndirectedGraphAlgorithm
{
public:
static vtkTulipReader *New();
vtkTypeMacro(vtkTulipReader, vtkUndirectedGraphAlgorithm);
void PrintSelf(ostream& os, vtkIndent indent);
//@{
/**
* The Tulip file name.
*/
vtkGetStringMacro(FileName);
vtkSetStringMacro(FileName);
//@}
protected:
vtkTulipReader();
~vtkTulipReader();
virtual int RequestData(
vtkInformation *,
vtkInformationVector **,
vtkInformationVector *);
/**
* Set the outputs to vtkUndirectedGraph and vtkAnnotationLayers.
*/
virtual int FillOutputPortInformation(int port, vtkInformation* info);
private:
char* FileName;
vtkTulipReader(const vtkTulipReader&) VTK_DELETE_FUNCTION;
void operator=(const vtkTulipReader&) VTK_DELETE_FUNCTION;
};
#endif // vtkTulipReader_h
|