Program to find the number of region in Planar Graph | C ++ implementation of the approach ; Function to return the number of regions in a Planar Graph ; Driver code
#include <bits/stdc++.h> NEW_LINE using namespace std ; int Regions ( int Vertices , int Edges ) { int R = Edges + 2 - Vertices ; return R ; } int main ( ) { int V = 5 , E = 7 ; cout << Regions ( V , E ) ; return 0 ; }