Homework Statement
Given connected, directed and weighted (positive weights) graph. Find the shortest cyclic path for each vertex. Cycles have back edges and can also be self loops.
2. The attempt at a solution
I need some clarifications for this problem related to implementation in C.
After...
Homework Statement
Given the representation of directed unweighted graph:
typedef struct
{
int n;//num. of vertices
void *info[MAX];//information of vertices
int am[MAX][MAX];//adjacency matrix
}GRAPH;
Write a function int minDegree(GRAPH*); and int maxDegree(GRAPH*); that return the...