Need help with graphs

[aurimax35]

Hey guys, Im student of IT and I have last hard programming task to do. I dont like programming and this task is too difficult. My task is Develop an algorithm and create a program with positive edge rays to find the radius. I dont have to enter vertex number. It can be already in code. Thanks anyway.

This is my code.

#include <stdio.h>
#include <limits.h>
#include<iostream>
using namespace std;
int V;

int minDistance(int dist[], bool sptSet[], int V)
{
   int Radius[V], Diameter[V];
   int min = INT_MAX, min_index;

   for (int v = 0; v < V; v++)
     if (sptSet[v] == false && dist[v] <= min)
         min = dist[v], min_index = v;

   return min_index;
}

int printSolution(int dist[], int n, int V)
{
   printf("Vertex   Distance from Source\n");
   for (int i = 0; i < V; i++)
      printf("%d tt %d\n", i, dist[i]);
      return 0;
}

void dijkstra(int graph[V][V], int src)
{
int dist[V];
bool sptSet[V];
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, V);
}

int main()
{
int v;
cout << "vertex number: "; cin >> v;
int graph[V][V];
for(int c = 0; c < v; c++)
{
for(int c1 = 0; c1 < v; c1++)
{
cout << "Vertex which connected " << c <<  " " << c1 << " vertex: "; cin >> graph[c][c1];
}
}
for(int c2 = 0; c2< 9; c2++)
{
dijkstra(graph, c2);
}
return 0;
}

[tpb]

You should edit your post and repaste your code in code tags: http://www.cplusplus.com/forum/articles/16853/
That way it's much easier to read.

create a program with positive edge rays to find the radius

What does that mean? Do you have a link?

[aurimax35]

every edge has weight and i need to find radius of weighted graph