Given a graph with a numeric attribute on its edges, sort the edges of t= he graph by the provided numeric attribute, and return the graph with only = the top N edges.

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

Can be used for a variety of purposes, for instance if one wanted to onl= y keep the top 100 strongest friendships in a larger graph of people who we= re friends with each other.

=20- =20
- Source Code =20

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