def splitGraph(G, edge):
	""" 
	Parameters:
		G: an igraph graph
		edge: an edge of the form (v1, v2) where v1 and v2 are vertices in G.
	
	Return value:
		A boolean value. True if removing the edge splits the graph.
	
	Notes:
		Checks to see if removing edge from G splits the graph into 2 disjoint
	communities. If so, returns True, otherwise False.
	"""

	return not G.edge_disjoint_paths(source=edge[0], target=edge[1])