If we have to install service make sure, .interframework install already.
Goto folder like:- C:\Windows\Microsoft.NET\Framework\v2.0.50727
C:\Windows\Microsoft.NET\Framework\v2.0.50727
(Note: version folder can be change as the version change.)
Open command prompt by writing the "cmd" in the box of file/folder location shoes
Run the command : "installUtil.exe pathofexeofthe service"
#include
ReplyDelete#include
using namespace std;
#define V 5 // Number of vertices in the graph
int minDistance(int dist[], bool sptSet[]) {
int min = INT_MAX, min_index;
for (int v = 0; v < V; v++) {
if (!sptSet[v] && dist[v] <= min) {
min = dist[v];
min_index = v;
}
}
return min_index;
}
void printSolution(int dist[]) {
cout << "Vertex \t Distance from Source\n";
for (int i = 0; i < V; i++)
cout << i << " \t " << dist[i] << endl;
}
void dijkstra(int graph[V][V], int src) {
int dist[V]; // The output array dist[i] holds the shortest distance from src to i.
bool sptSet[V]; // sptSet[i] will be true if vertex i is included in the shortest
// path tree or the shortest distance from src to i is finalized
for (int i = 0; i < V; i++) {
dist[i] = INT_MAX;
sptSet[i] = false;
}
dist[src] = 0;
for (int count = 0; count < V - 1; count++) {
int u = minDistance(dist, sptSet);
sptSet[u] = true;
for (int v = 0; v < V; v++) {
if (!sptSet[v] && graph[u][v] && dist[u] != INT_MAX &&
dist[u] + graph[u][v] < dist[v]) {
dist[v] = dist[u] + graph[u][v];
}
}
}
printSolution(dist);
}
int main() {
int graph[V][V] = {{0, 2, 0, 6, 0},
{2, 0, 3, 8, 5},
{0, 3, 0, 0, 7},
{6, 8, 0, 0, 9},
{0, 5, 7, 9, 0}};
dijkstra(graph, 0);
return 0;
}
meenu: +91 78408 53932
ReplyDeleteprince: +91 89602 40871
ReplyDeleteVishnu: +91 95995 34346
ReplyDeletehttps://mantis.ondgni.com/mantissupport/login_page.php?return=%2Fmantissupport%2Fmanage_user_create_page.php
ReplyDelete
ReplyDelete<add key="Oledb_ConStr" value="Provider=Microsoft.Jet.OLEDB.4.0;Data
server=192.168.1.16;port=3333;user id=root; password=reliable@123;database=machost_reliable;
ReplyDelete