Fix typos and minor cleanup

graph/iterator.go

@@ -49,7 +49,7 @@ type Iterator interface {
 	// These methods are the heart and soul of the iterator, as they constitute
 	// the iteration interface.
 	//
-	// To get the full results of iteraton, do the following:
+	// To get the full results of iteration, do the following:
 	// while (!Next()):
 	//   emit result
 	//   while (!NextResult()):

graph/iterator/all_iterator.go

@@ -17,7 +17,7 @@ package iterator
 // Defines one of the base iterators, the All iterator. Which, logically
 // enough, represents all nodes or all links in the graph.
 //
-// This particular file is actually vestigal. It's up to the TripleStore to give
+// This particular file is actually vestigial. It's up to the TripleStore to give
 // us an All iterator that represents all things in the graph. So this is
 // really the All iterator for the MemTripleStore. That said, it *is* one of
 // the base iterators, and it helps just to see it here.

graph/triplestore.go

@@ -74,7 +74,7 @@ type TripleStore interface {
 
 	// Optimize an iterator in the context of the triple store.
 	// Suppose we have a better index for the passed tree; this
-	// gives the TripleStore the oppotunity to replace it
+	// gives the TripleStore the opportunity to replace it
 	// with a more efficient iterator.
 	OptimizeIterator(it Iterator) (Iterator, bool)
 
@@ -82,7 +82,7 @@ type TripleStore interface {
 	// sever connections, etc)
 	Close()
 
-	// Convienence function for speed. Given a triple token and a direction
+	// Convenience function for speed. Given a triple token and a direction
 	// return the node token for that direction. Sometimes, a TripleStore
 	// can do this without going all the way to the backing store, and
 	// gives the TripleStore the opportunity to make this optimization.