Best way to find neighbors of a node in a VG graph?
Entering edit mode
2.2 years ago
samantha.hao ▴ 10


What is the best way to extract the neighboring nodes of a given node ID in a VG graph? I can think of a couple, but it's not clear which would be the most direct way:

  1. vg find -n ID -c 1 -x graph.xg | vg view -j - would give a json that contains the node IDs.

  2. vg stats -S would output a table where I could search for the desired node ID lines.

There are a few more methods I can think of that indirectly give me the information by parsing a JSON, but I was wondering if there's a more direct way?

Thanks in advance,


vg vgteam variation graph • 575 views
Entering edit mode
2.2 years ago
glenn.hickey ▴ 250

vg find is probably the best. You may find the GFA output (vg view without the -j) easier to read or parse. Also note that it no longer requires an xg file, so you could use the same command on too, and -c can be increased to pull larger subgraphs.

Python bindings to access the graph structure are in the works. They'll build on what was developed here:


Login before adding your answer.

Traffic: 1768 users visited in the last hour
Help About
Access RSS

Use of this site constitutes acceptance of our User Agreement and Privacy Policy.

Powered by the version 2.3.6