Maximum number of edges in Bipartite graph | Java implementation of the approach ; Function to return the maximum number of edges possible in a Bipartite graph with N vertices ; Driver code
class GFG { public static double maxEdges ( double N ) { double edges = 0 ; edges = Math . floor ( ( N * N ) / 4 ) ; return edges ; } public static void main ( String [ ] args ) { double N = 5 ; System . out . println ( maxEdges ( N ) ) ; } }