List test paths that achieve node coverage but not edge coverage on the graph.   public boolean isPerfect(int x) {                         int sum = 0;                         Boolean output;                         for(int i = 1; i<=(x/2); i ++) {                                     if(x%i == 0) {                                                 sum = sum + i;                                     }                         }                                                 if(sum == x) {                                     output = true;                         }else {                                     output = false;                         }                     return output;                }

In a graph, two vertices are connected if there is a path between them. If all vertices are connected, we say the graph is connected. Given the Graph ADT below: class Graph { public: void addEdge (int vl, int v2); void delEdge (int vl, int v2); bool hasEdge (int v1, int v2) const; VList adj (int v) const; int v() const; int e() const; } ; Fill in the function isConnected that tells whether graph g is connected or not. Note that you can only use the above methods for g. You may assume vertex ID starts from 0 and define other helper functions if necessary. bool isConnected (const Graph &g) { // Copy this function in the answer and add code below this line. For the toolbar, press ALT+F10 (PC) or ALT+FN+F10 (Mac).

GIVEN THE FOLLOWING STRING : ACGCGTCG DRAW DE BRUIJN GRAPH WHERE K=3

in C language implement a graph coloring method that assigns the minimum color to each vertex so it does conflict with vertices that have been colored (using adjacency list)