Challenge 5: Count the Number of Edges in an Undirected Graph
In this lesson, you will figure out if it's possible to count the total number of edges in a graph.
Problem statement
You have to implement the int numEdges(Graph g) function, which takes an undirected graph and computes the total number of bidirectional edges. An illustration ...
Access this course and 1400+ top-rated courses and projects.