Given a graph with a numeric attribute on its nodes, sort the node of th= e graph by the provided numeric attribute, and return the graph with only t= he top N nodes. Any edges connected to removed nodes will be removed as wel= l.

=20- =20
**Extract N top nodes**- Determines how many of the top n= odes we want to keep. =20
**Ascending?**- If Ascending is selected (which it is by = default), we sort the nodes such that the greater values are at the top. If= ascending is not selected, we sort the nodes such that the least values ar= e on top. Essentially, if ascending is de-selected, we take the bottom N no= des instead of the top N nodes. =20
**Numeric Attribute**- Determines which numeric node attr= ibute is used to sort the edges. If no numeric attributes are present on th= e graph's nodes, the algorithm cannot be run. =20

Can be used for a variety of purposes, for instance if we want to only k= eep the top 100 most populous cities in a graph of U.S. cities.

=20- =20
- Source Code =20

The license could not be verified: License Certificate has expired!=20
Generate a Free license now.