Shortest interaction paths

We have implemented an advanced algorithm for finding the shortest path between vertices.

In addition to finding the shortest path between two vertices, you can also look for shortcuts that are sure to go through further introduced genes.

And you can specify multiple start and end a few peaks, the algorithm renders all possible ways, if they exist.

We continue to improve the shortest path search algorithms and create something like for example a constructor that flexibly build a complex network of interactions.
Info

Union Genes (
)
:
Order:

Set 1 unique genes (
)
:
Order:

Set 2 unique genes (
)
:
Order:
Drugs and Targets there..
Oncosupressions microRNA chart there..
Oncogenic microRNA chart there..
graphviz test: