Compute a given property of a graph.

Input parameters:

1. Gf → Graph to measure.
2. Pr → Property to measure.
   • 10 → Total Nodes
   • 11 → Isolated Nodes
   • 12 → Terminal Nodes
   • 13 → Transit Nodes
   • 14 → Junction Nodes
   • 15 → Source Nodes
   • 16 → Sink Nodes
   • 17 → Branch Nodes
   • 18 → Cycle Nodes
   • 19 → Minimum Valence
   • 20 → Maximum Valence
   • 30 → Total Edges
   • 31 → One-Way Edges
   • 32 → Two-Way Edges
   • 38 → Branch Edges
   • 39 → Cycle Edges
   • 50 → Total Length
   • 51 → One-Way Length
   • 52 → Two-Way Length
   • 53 → Branch Length
   • 54 → Cycle Length
   • 55 → Shortest Edge
   • 56 → Longest Edge
   • 70 → Disjointness
   • 71 → Disjoint Count

Output parameters:

1. Pr → Requested graph property.