Started writing salesman_brute

I wrote a class to represent a graph.  The module is still in progress.
There are some things that could probably be added to the class.  I still
need to write code to traverse the graph and perform the brute force
algorithm.
Merge branch 'master' of webserv:~/git/praxis
Updated the index
Finished the graph class

The most substantial change was a change to the graph data structure.  The
value of each node is now a dictionary instead of a list.  This permits
easier addition and deletion of nodes.

Several features have been added to the graph class:
  - The copy function was fixed.
  - The __init__ function can now cast a dictionary to a graph
  - Nodes can be added without any edges
  - Edges can be added separately
  - Nodes can be deleted
  - A function to count the number of nodes in the graph

I additionally wrote a brute force traveling salesman function, but it is
not functional because it solves the wrong problem.  (The function simply
finds the shortest path between two nodes, not the shortest path that visits
every point.)
Merge branch 'master' of webserv:~/git/praxis
Started writing the brute force algorithm

Alos added a default graph to test the problem on.

Moved the import statements outside of the functions
Removed salesman_brute until it's finished
Changed variables in functions to lower case
Fixed bug due to failure to deep copy.

The code still has another bug in the shortest_path function that needs to
be fixed.
Finished brute force traveling salesman solution
Merge branch 'develop'

Conflicts:
	salesman_brute/salesman_brute.py
Merge salesman_brute from develop