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
108
109
110
111
112
113
114
115
116
117
118
|
/*=========================================================================
Program: Visualization Toolkit
Module: $RCSfile: vtkDIMACSGraphWriter.cxx,v $
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 (c) Sandia Corporation
See Copyright.txt or http://www.paraview.org/HTML/Copyright.html for details.
----------------------------------------------------------------------------*/
#include "vtkDIMACSGraphWriter.h"
#include "vtkCellArray.h"
#include "vtkCellData.h"
#include "vtkDirectedGraph.h"
#include "vtkEdgeListIterator.h"
#include "vtkGraph.h"
#include "vtkInformation.h"
#include "vtkObjectFactory.h"
#include "vtkSmartPointer.h"
#define VTK_CREATE(type, name) \
vtkSmartPointer<type> name = vtkSmartPointer<type>::New()
vtkStandardNewMacro(vtkDIMACSGraphWriter);
void vtkDIMACSGraphWriter::WriteData()
{
vtkGraph* const input = this->GetInput();
vtkDebugMacro(<<"Writing vtk graph data...");
ostream *fp = this->OpenVTKFile();
if(!fp)
{
vtkErrorMacro("Falied to open output stream");
return;
}
*fp << "c vtkGraph as DIMACS format\n";
if(vtkDirectedGraph::SafeDownCast(input))
{
*fp << "c Graph stored as DIRECTED\n";
}
else
{
*fp << "c Graph stored as UNDIRECTED\n";
}
const vtkIdType vertex_count = input->GetNumberOfVertices();
const vtkIdType edge_count = input->GetNumberOfEdges();
// Output this 'special' line with the 'problem type' and then
// vertex and edge counts
*fp << "p graph "<< vertex_count << " " << edge_count << "\n";
// See if the input has a "weight" array
vtkDataArray* weight = 0;
weight = input->GetEdgeData()->GetArray("weight");
// Output either the weight array or just 1 if
// we have no weight array
VTK_CREATE(vtkEdgeListIterator, edges);
input->GetEdges(edges);
if (weight)
{
while(edges->HasNext())
{
vtkEdgeType e = edges->Next();
float value = weight->GetTuple1(e.Id);
*fp << "e " << e.Source+1 << " " << e.Target+1 << " " << value << "\n";
}
}
else
{
while(edges->HasNext())
{
vtkEdgeType e = edges->Next();
*fp << "e " << e.Source+1 << " " << e.Target+1 << " 1\n";
}
}
// NOTE: Vertices are incremented by 1 since DIMACS files number vertices
// from 1..n.
this->CloseVTKFile(fp);
}
int vtkDIMACSGraphWriter::FillInputPortInformation(int, vtkInformation *info)
{
info->Set(vtkAlgorithm::INPUT_REQUIRED_DATA_TYPE(), "vtkGraph");
return 1;
}
vtkGraph* vtkDIMACSGraphWriter::GetInput()
{
return vtkGraph::SafeDownCast(this->Superclass::GetInput());
}
vtkGraph* vtkDIMACSGraphWriter::GetInput(int port)
{
return vtkGraph::SafeDownCast(this->Superclass::GetInput(port));
}
void vtkDIMACSGraphWriter::PrintSelf(ostream& os, vtkIndent indent)
{
this->Superclass::PrintSelf(os,indent);
}
|
