Given a graph with a numeric attribute on its nodes, return a graph which only contains nodes where the specified numeric attribute is above (or less-than-or-equal-to) some value. If a node is not included in the final graph, all edges connected to that node will node be included either.


This algorithm can be used for a variety of purposes, whenever one has a large graph, and wants to get rid of certain nodes whose value is outside the range we are interested in.

See Also