anchor.diff:  export GIRAPH_HOME=/usr/local/giraph-1.0.0
   export GIRAPH_GREMLIN_HOME=/usr/local/giraph-gremlin-3.0.0
   
  -If using the <<gremlinconsole,Gremlin Console>>, it is important to install the Giraph-Gremlin plugin.
  +If using the <<gremlin-console,Gremlin Console>>, it is important to install the Giraph-Gremlin plugin.
   
   [source,text]
   ----
  
positive.code: 
  By extending Traversal, users can create a DSL that is respective of the semantics of their data. Instead of querying in terms of vertices/edges/properties, they can query in terms of, for example, people, their friends, and their names.
  
  The GraphComputer API
  =====================
  
  
negative.code: Match Step
  ~~~~~~~~~~
  
  `MatchStep` was introduced into TinkerPop3 to support a more link:http://en.wikipedia.org/wiki/Declarative_programming[declarative] form of link:http://en.wikipedia.org/wiki/Pattern_matching[pattern matching]. Similar constructs were available in previous TinkerPop versions via the `table()`-step, but that has since been removed in favor of the `match().select()`-pattern. With MatchStep in TinkerPop, a query optimizer exists based on the link:http://www.knowledgefrominformation.com/2011/04/16/budget-match-cost-effective-subgraph-matching-on-large-networks/[budget match algorithm]. For very large graphs, where the developer is uncertain of the statistics of the graph (e.g. how many `knows`-edges vs. `worksFor`-edges exist in the graph), it is best to use `match()` as the optimal traversal path will be determined automatically.
  
  	"Who created a project named 'lop' that was also created by someone who is 29 years old? Return the two creators."
  
  