def path_I_E_S(graph, sets):
""" Given a graph and a set of communities, finds the series of (I, E, S)
values.
Parameters
----------
graph : a networkx graph
sets : a list of lists, where each internal list is a set of communities
"""
I_path = []
E_path = []
S_path = []
for c_set in sets:
(I, E, S) = CD.I_E_S(graph, c_set)
I_path.append(I)
E_path.append(E)
S_path.append(S)
return I_path, E_path, S_path
