本文整理汇总了C++中PropertyMap::containsPropertySet方法的典型用法代码示例。如果您正苦于以下问题：C++ PropertyMap::containsPropertySet方法的具体用法？C++ PropertyMap::containsPropertySet怎么用？C++ PropertyMap::containsPropertySet使用的例子？那么, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类PropertyMap的用法示例。
在下文中一共展示了PropertyMap::containsPropertySet方法的2个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C++代码示例。
示例1: computeNearestNeighborsDegree
void ProgramState::computeNearestNeighborsDegree(PropertyMap& propertyMap) {
if (!propertyMap.containsPropertySet("degreeDistribution")) {
computeDegreeDistribution(propertyMap);
}
VariantsSet& degrees = propertyMap.getPropertySet("degreeDistribution");
VariantsSet::const_iterator it = degrees.begin();
double knn = 0;
if (isWeighted()) {
IGraphFactory<WeightedGraph, WeightedVertex> *weightedFactory = new WeightedGraphFactory<WeightedGraph, WeightedVertex>();
INearestNeighborsDegree<WeightedGraph, WeightedVertex> *nearestNeighborDegree = weightedFactory->createNearestNeighborsDegree();
while (it != degrees.end()) {
knn = nearestNeighborDegree->meanDegree(weightedGraph, from_string<unsigned int>(it->first));
propertyMap.addProperty<double>("nearestNeighborDegreeForDegree", it->first, knn);
++it;
}
delete nearestNeighborDegree;
} else {
IGraphFactory<Graph, Vertex> *factory = new GraphFactory<Graph, Vertex>();
INearestNeighborsDegree<Graph, Vertex> *nearestNeighborDegree = factory->createNearestNeighborsDegree();
while (it != degrees.end()) {
knn = nearestNeighborDegree->meanDegree(graph, from_string<unsigned int>(it->first));
propertyMap.addProperty<double>("nearestNeighborDegreeForDegree", it->first, knn);
++it;
}
delete nearestNeighborDegree;
}
}示例2: computeClusteringCoefficient
void ProgramState::computeClusteringCoefficient(PropertyMap& propertyMap) {
if (!propertyMap.containsPropertySet("degreeDistribution")) {
computeDegreeDistribution(propertyMap);
}
VariantsSet& degrees = propertyMap.getPropertySet("degreeDistribution");
VariantsSet::const_iterator it = degrees.begin();
double cc = 0;
if (isWeighted()) {
IGraphFactory<WeightedGraph, WeightedVertex> *weightedFactory = new WeightedGraphFactory<WeightedGraph, WeightedVertex>();
IClusteringCoefficient<WeightedGraph, WeightedVertex> *clusteringCoefficient = weightedFactory->createClusteringCoefficient();
while (it != degrees.end()) {
cc = clusteringCoefficient->clusteringCoefficient(weightedGraph, from_string<unsigned int>(it->first));
propertyMap.addProperty<double>("clusteringCoeficientForDegree", it->first, cc);
++it;
}
delete clusteringCoefficient;
} else {
IGraphFactory<Graph, Vertex> *factory = new GraphFactory<Graph, Vertex>();
IClusteringCoefficient<Graph, Vertex>* clusteringCoefficient = factory->createClusteringCoefficient();
while (it != degrees.end()) {
cc = clusteringCoefficient->clusteringCoefficient(graph, from_string<unsigned int>(it->first));
propertyMap.addProperty<double>("clusteringCoeficientForDegree", it->first, cc);
++it;
}
delete clusteringCoefficient;
}
}