Maximum number of edges in Bipartite graph | C ++ implementation of the approach ; Function to return the maximum number of edges possible in a Bipartite graph with N vertices ; Driver code
#include <bits/stdc++.h> NEW_LINE using namespace std ; int maxEdges ( int N ) { int edges = 0 ; edges = floor ( ( N * N ) / 4 ) ; return edges ; } int main ( ) { int N = 5 ; cout << maxEdges ( N ) ; return 0 ; }