human
Number of pair of positions in matrix which are not accessible | Counts number of vertices connected in a component containing x . Stores the count in k ..
Incrementing the number of node in a connected component ..
Return the number of count of non - accessible cells ..
Initialize count of connected vertices found by DFS starting from i ..
Update result.
Inserting the edge between edge ..
Mapping the cell coordinate into node number ..
Inserting the edge ..
Driver Code"
How can the above be solved in Python?
 ... Write me a code to number of pair of positions in matrix which are not accessible and the other steps required?
assistant
#Here is code to number of pair of positions in matrix which are not accessible and the other steps required.
 def dfs ( graph , visited , x , k ) :
	for i in range ( len ( graph [ x ] ) ) :
		if ( not visited [ graph [ x ] [ i ] ] ) :
			k [ 0 ] += 1
			visited [ graph [ x ] [ i ] ] = True
			dfs ( graph , visited , graph [ x ] [ i ] , k )
def countNonAccessible ( graph , N ) :
	visited = [ False ] * ( N * N + N )
	ans = 0
	for i in range ( 1 , N * N + 1 ) :
		if ( not visited [ i ] ) :
			visited [ i ] = True
			k = [ 1 ]
			dfs ( graph , visited , i , k )
			ans += k [ 0 ] * ( N * N - k [ 0 ] )
	return ans
def insertpath ( graph , N , x1 , y1 , x2 , y2 ) :
	a = ( x1 - 1 ) * N + y1
	b = ( x2 - 1 ) * N + y2
	graph [ a ] . append ( b )
	graph [ b ] . append ( a )
if __name__ == ' _ _ main _ _ ' :
	N = 2
	graph = [ [ ] for i in range ( N * N + 1 ) ]
	insertpath ( graph , N , 1 , 1 , 1 , 2 )
	insertpath ( graph , N , 1 , 2 , 2 , 2 )
	print ( countNonAccessible ( graph , N ) )