graph: edge cuts

From: Matthew Galati (yg-boost-users_at_[hidden])
Date: 2002-08-14 10:02:56

is this a place for simple usage questions?

i am a newbie...

i want to use graph to return the set of edges in a cut for an
undirected graph...

that is, for some subset W of N, i want all e = {i in N, j in N} in E
such that i is in W and j is not in W

is there something built into graph to do this? or should i just do it
manually from the adjacency list?

thanks,
matt

--
Matthew Galati
Lehigh University, Bethlehem, PA - Operations Research, M.S.
Stetson University, Deland, FL - Mathematics, B.S.
Office Phone: [phone]
Email: magh_at_[hidden]
URL: http://www.lehigh.edu/~magh/magh.html