Skip to main content
. Author manuscript; available in PMC: 2017 Mar 22.
Published in final edited form as: ACM Trans Intell Syst Technol. 2016 Oct 3;8(1):1. doi: 10.1145/2898361

Listing 1.

Listing 1

Iterating over Nodes and Edges. Top example prints out the ids and out-degrees of all the nodes. Bottom example prints out all the edges as pairs of edge source node id and edge destination node id. These traversals can be executed on any type of a graph/network container.