数据结构
网络
RDBMS
操作系统
Java
MS Excel
iOS
HTML
CSS
Android
Python
C 编程
C++
C#
MongoDB
MySQL
Javascript
PHP
物理学
化学
生物学
数学
英语
经济学
心理学
社会学
时尚学
法律学C++ 程序解决支配集问题
这是一个 C++ 程序，用于解决支配集问题。
算法
Begin Take the number of vertices and edges as input. Also take the edge point of the edges. function dominant(): Declare vector Set. Take any edge e graph connecting the vertices i.e.; X and Y. Add one vertex between X and Y to set s. Delete all the edges connected to X. End
范例
#include<bits/stdc++.h>
using namespace std;
vector<vector<int> > g;
bool visit[10001];
int i,j;
vector<int> dominant(int v,int e) {
vector<int> Set;
//Take any edge e graph connecting the vertices i.e.; X and Y.
for(i=0;i<v;i++) {
if(!visit[i]) {
Set.push_back(i); //Add vertex
visit[i]=true;
for(j=0;j<(int)g[i].size();j++) {
if(!visit[g[i][j]]) {
visit[g[i][j]]=true;
break;
}
}
}
}
return Set;
}
int main() {
int v,e,a,b;
cout<<"Enter number of vertices:";
cin>>v;
cout<<"Enter number of Edges:";
cin>>e;
g.resize(v);
memset(visit,0,sizeof(visit)); //set all index value of an array as 0
for(i=0;i<e;i++) {
cout<<"Enter the end-points of edge "<<i+1<<" : ";
cin>>a>>b;
a--; b--;
g[a].push_back(b);
g[b].push_back(a);
}
vector<int> Set = dominant(v,e);
cout<<"The Dominant Set is:\n";
for(i=0;i<(int)Set.size();i++)
cout<<Set[i]+1<<" ";
return 0;
}输出
Enter number of vertices:7 Enter number of Edges:6 Enter the end-points of edge 1 : 1 2 Enter the end-points of edge 2 : 2 2 Enter the end-points of edge 3 : 3 4 Enter the end-points of edge 4 : 4 5 Enter the end-points of edge 5 : 6 7 Enter the end-points of edge 6 : 4 5 The Dominant Set is: 1 3 5 6
更新于：30-Jul-2019
312 浏览
广告