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 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280
|
/************************************************************************************
Copyright (C) 2005-2008 Assefaw H. Gebremedhin, Arijit Tarafdar, Duc Nguyen,
Alex Pothen
This file is part of ColPack.
ColPack 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 3 of the License, or
(at your option) any later version.
ColPack 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. See the
GNU Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public License
along with ColPack. If not, see <http://www.gnu.org/licenses/>.
************************************************************************************/
#include "ColPackHeaders.h"
using namespace std;
namespace ColPack
{
//Virtual Function 1102
void GraphCore::Clear() //!< Reinitialize all variables
{
m_i_MaximumVertexDegree = _UNKNOWN;
m_i_MinimumVertexDegree = _UNKNOWN;
m_d_AverageVertexDegree = _UNKNOWN;
m_s_InputFile.clear();
m_vi_Vertices.clear();
m_vi_Edges.clear();
m_vd_Values.clear();
return;
}
//Public Function 1103
int GraphCore::GetVertexCount()
{
return(STEP_DOWN(m_vi_Vertices.size()));
}
//Public Function 1104
int GraphCore::GetEdgeCount()
{
return(m_vi_Edges.size()/2);
}
//Public Function 1105
int GraphCore::GetMaximumVertexDegree()
{
return(m_i_MaximumVertexDegree);
}
//Public Function 1106
int GraphCore::GetMinimumVertexDegree()
{
return(m_i_MinimumVertexDegree);
}
//Public Function 1107
double GraphCore::GetAverageVertexDegree()
{
return(m_d_AverageVertexDegree);
}
//Public Function 1108
string GraphCore::GetInputFile()
{
return(m_s_InputFile);
}
//Public Function 1109
void GraphCore::GetVertices(vector<int> &output) const
{
output = (m_vi_Vertices);
}
//Public Function 1110
void GraphCore::GetEdges(vector<int> &output) const
{
output = (m_vi_Edges);
}
//Public Function 1111
void GraphCore::GetValues(vector<double> &output) const
{
output = (m_vd_Values);
}
void GraphCore::GetVertexEdgeMap(map< int, map< int, int> > &output)
{
//cerr<<"IN GraphCore::GetVertexEdgeMa()"<<endl;
//GraphColoringInterface::PrintVertexEdgeMap(m_vi_Vertices, m_vi_Edges, m_mimi2_VertexEdgeMap);
//cerr<<"OUT GraphCore::GetVertexEdgeMa()"<<endl;
output = (m_mimi2_VertexEdgeMap);
}
void GraphCore::GetDisjointSets(DisjointSets &output)
{
//cerr<<"START In Graph ds_DisjointSets.Print()"<<endl;
//m_ds_DisjointSets.Print();
//cerr<<"END ds_DisjointSets.Print()"<<endl;
//Pause();
output = (m_ds_DisjointSets);
}
void GraphCore::GetD1Neighbor(int VertexIndex, vector<int> &D1Neighbor, int excludedVertex) {
if(VertexIndex > (int)m_vi_Vertices.size() - 2) {
cout<<"Illegal request. VertexIndex is too large. VertexIndex > m_vi_Vertices.size() - 2"<<endl;
return;
}
if(VertexIndex < 0) {
cout<<"Illegal request. VertexIndex is too small. VertexIndex < 0"<<endl;
return;
}
D1Neighbor.clear();
for(int i=m_vi_Vertices[VertexIndex]; i<m_vi_Vertices[STEP_UP(VertexIndex)]; i++) {
if( excludedVertex == m_vi_Edges[i]) continue;
D1Neighbor.push_back(m_vi_Edges[i]);
}
}
///Print all the Distance-1 neighbors of VertexIndex, except the excludedVertex
void GraphCore::PrintVertexD1Neighbor(int VertexIndex, int excludedVertex) {
if(VertexIndex > (int)m_vi_Vertices.size() - 2) {
cout<<"Illegal request. VertexIndex is too large. VertexIndex > m_vi_Vertices.size() - 2"<<endl;
return;
}
if(VertexIndex < 0) {
cout<<"Illegal request. VertexIndex is too small. VertexIndex < 0"<<endl;
return;
}
cout<<"Distance-1 neighbors of "<<VertexIndex<<" are (0-based): ";
for(int i=m_vi_Vertices[VertexIndex]; i<m_vi_Vertices[STEP_UP(VertexIndex)]; i++) {
if( excludedVertex == m_vi_Edges[i]) continue;
cout<<m_vi_Edges[i]<<" ";
}
cout<<"( # of edges = "<<m_vi_Vertices[STEP_UP(VertexIndex)] - m_vi_Vertices[VertexIndex]<<")"<<endl;
}
/// Print all the Distance-2 neighbors of VertexIndex
void GraphCore::PrintVertexD2Neighbor(int VertexIndex) {
cout<<"--Distance-1 neighbors of "<<VertexIndex<<" are: --------------------------"<<endl;
for(int i=m_vi_Vertices[VertexIndex]; i<m_vi_Vertices[STEP_UP(VertexIndex)]; i++) {
PrintVertexD1Neighbor(m_vi_Edges[i], VertexIndex);
}
cout<<"----------------------------------------------------"<<endl;
}
/// Check and see if VertexIndex1 and VertexIndex2 are Distance-2 neighbor
/** Algorithm:
- Get the set D1_of_VertexIndex1 of all the Distance-1 neighbors of VertexIndex1
- Get the set D1_of_VertexIndex2 of all the Distance-1 neighbors of VertexIndex2
- Intersect D1_of_VertexIndex1 and D1_of_VertexIndex2 to see which vertices VertexIndex1 and VertexIndex2 have in common. The result is stored in Intersect_set
- If the size of Intersect_set > 0 => VertexIndex1 and VertexIndex2 are Distance-2 neighbor
*/
bool GraphCore::AreD2Neighbor(int VertexIndex1, int VertexIndex2) {
set<int> D1_of_VertexIndex1, D1_of_VertexIndex2;
vector<int> Intersect_set;
for(int i=m_vi_Vertices[VertexIndex1]; i<m_vi_Vertices[STEP_UP(VertexIndex1)]; i++)
D1_of_VertexIndex1.insert(m_vi_Edges[i]);
for(int i=m_vi_Vertices[VertexIndex2]; i<m_vi_Vertices[STEP_UP(VertexIndex2)]; i++)
D1_of_VertexIndex2.insert(m_vi_Edges[i]);
Intersect_set.resize(D1_of_VertexIndex1.size(),-1);
set_intersection(D1_of_VertexIndex1.begin(), D1_of_VertexIndex1.end(),
D1_of_VertexIndex2.begin(), D1_of_VertexIndex2.end(),
Intersect_set.begin() );
int size = Intersect_set.size();
while(Intersect_set[size-1] == -1 && size >= 1) size--;
Intersect_set.resize(size,-1);
if(size>0) {
//Print
printf("%d and %d connected through vertices: ", VertexIndex1, VertexIndex2);
copy(Intersect_set.begin(), Intersect_set.end(), ostream_iterator<int>(cout, " "));
cout << endl;
return true;
}
return false;
/*
//Print
printf("%d and %d connected through vertices: ", VertexIndex1, VertexIndex2);
set_intersection(D1_of_VertexIndex1.begin(), D1_of_VertexIndex1.end(),
D1_of_VertexIndex2.begin(), D1_of_VertexIndex2.end(),
ostream_iterator<int>(cout, " ") );
cout << endl;
//*/
}
bool GraphCore::operator==(const GraphCore &other) const {
// Check for self-assignment!
if (this == &other) // Same object?
return true; // Yes, so the 2 objects are equal
//Compare vector<int> m_vi_Vertices; vector<int> m_vi_Edges; vector<double> m_vd_Values;
vector<int> other_Vertices, other_Edges;
vector<double> other_Values;
other.GetVertices(other_Vertices);
other.GetEdges(other_Edges);
other.GetValues(other_Values);
/*
if(m_vi_Vertices==other_Vertices) cout<<"m_vi_Vertices==other_Vertices"<<endl;
else cout<<"m_vi_Vertices!=other_Vertices"<<endl;
if(m_vi_Edges==other_Edges) cout<<"m_vi_Edges==other_Edges"<<endl;
else cout<<"m_vi_Edges!=other_Edges"<<endl;
if(m_vd_Values==other_Values) cout<<"m_vd_Values==other_Values"<<endl;
else cout<<"m_vd_Values!=other_Values"<<endl;
//*/
if(m_vi_Vertices==other_Vertices && m_vi_Edges==other_Edges && m_vd_Values==other_Values ) return true;
else return false;
}
bool GraphCore::areEqual(const GraphCore &other, bool structureOnly) const {
// Check for self-assignment!
if (this == &other) // Same object?
return true; // Yes, so the 2 objects are equal
//Compare vector<int> m_vi_Vertices; vector<int> m_vi_Edges; vector<double> m_vd_Values;
vector<int> other_Vertices, other_Edges;
vector<double> other_Values;
other.GetVertices(other_Vertices);
other.GetEdges(other_Edges);
if (!structureOnly) other.GetValues(other_Values);
/*
if(m_vi_Vertices==other_Vertices) cout<<"m_vi_Vertices==other_Vertices"<<endl;
else cout<<"m_vi_Vertices!=other_Vertices"<<endl;
if(m_vi_Edges==other_Edges) cout<<"m_vi_Edges==other_Edges"<<endl;
else cout<<"m_vi_Edges!=other_Edges"<<endl;
if(m_vd_Values==other_Values) cout<<"m_vd_Values==other_Values"<<endl;
else cout<<"m_vd_Values!=other_Values"<<endl;
//*/
if(!structureOnly) {
if(m_vi_Vertices==other_Vertices && m_vi_Edges==other_Edges && m_vd_Values==other_Values ) return true;
else return false;
}
else { //structureOnly
if(m_vi_Vertices==other_Vertices && m_vi_Edges==other_Edges ) return true;
else return false;
}
}
}
|