Graphics Reference
In-Depth Information
it.helpful]}
==>[Graph Drawing: Algorithms for the Visualization of
Graphs, 3, 36]
==>[Graph Drawing: Algorithms for the Visualization of
Graphs, 1, 5]
==>[Graph Drawing: Algorithms for the Visualization of
Graphs, 4, 4]
==>[Graph Drawing: Algorithms for the Visualization of
Graphs, 5, 0]
The queries have so far found nodes and output incoming edges. One of
the more central and powerful design features of Gremlin, however, is a
grammar for traversing links to other nodes. For example, the following
query will find topics that are linked by similarity to the graph-drawing
algorithmsbook.Theterm
both()
hereselectsbothoutgoingandincoming
edges, accounting for cases when the topic is either the subject or object of
similarity.
gremlin>
g.V('group','Book').has('title',CONTAINS,'Graph').has('title',
CONTAINS,'Visualization').both('similar').title
==>Algorithms on Strings, Trees, and Sequences:
Computer Science and
Computational Biology
==>Computational Analysis of Biochemical Systems : A
Practical Guide
for Biochemists and Molecular Biologists
==>Drawing Graphs : Methods and Models (Lecture Notes
in Computer
Science)
==>Computational Modeling of Genetic and Biochemical
Networks
(Computational Molecular Biology)
==>Introduction to Graph Theory (Dover topics on
Advanced Mathematics)
==>Drawing Graphs : Methods and Models (Lecture Notes
in Computer
Science)
