3-edge connectivity problem
I need help with a pseudocode for an algorithm that solves the 3-edge connectivity problem:
input: a graph G in adjacency matrix format
output: true if, for every pair of vertices v,w elements of G, there exists a path from v to w of length at most 3
Here is what I got so far. Thank you!
const int WIDTH = 10
Const HIGHT =10
Int arrayMatrix [WIDTH] [HIGHT];
For (int i =0; i< WIDTH; i++)
For (int j =0; j<HIGHT; j++)
Int countEdges =0;
countEdges = countEdges +arrayMatrix [i];
cout << "True for 3-edge connectivity problem" << endl;
cout <<"Not found" << enld;
Topic archived. No new replies allowed.