# HG changeset patch
# User Eugen Sawin <sawine@me73.com>
# Date 1299333845 -3600
# Node ID e088ae08440c587304ae602ea2d4d5c6e178cada
# Parent  f09e54fbdcaf144eac77d4400646361e6faf665e
Minor changes to the example programs.

diff -r f09e54fbdcaf -r e088ae08440c examples/rsa.py
--- a/examples/rsa.py	Sat Mar 05 14:23:15 2011 +0100
+++ b/examples/rsa.py	Sat Mar 05 15:04:05 2011 +0100
@@ -9,7 +9,7 @@
 from random import choice
 
 def main():
-    args = parse_arguments()
+    args = parse_args()
     if args.e:
         m, e, n = args.e
         print encrypt(m, e, n)
@@ -53,7 +53,7 @@
 
 from argparse import ArgumentParser
 
-def parse_arguments():
+def parse_args():
     parser = ArgumentParser(description='Applies the Dijkstra algorithm for the single source shortest path problem.')
     parser.add_argument('-e', metavar=('M', 'K', 'N'), type=int, nargs=3, help='sequence of (u, v, c(u,v))')
     parser.add_argument('-d', metavar=('M', 'K', 'N'), type=int, nargs=3, help='source vertex')