Nodes should be strongly typed, and should be able to be accessed by name. Where compile-time checks can't be enforced (such as for nodes with mutable dependencies), tools should be provided to ensure ...

PathFinder is a Java program for computing the shortest path between two nodes in a graph. It can handle various types of graphs, including directed, undirected, weighted, and unweighted.

In de novo genome assembly using short Illumina reads, the accurate determination of node and arc multiplicities in a de Bruijn graph has a large impact on the quality and contiguity of the assembly.

We describe a security visualization tool for finding algorithmic complexity attacks in Java bytecode. Our tool, which we call J-Viz, visualizes connected directed graphs derived from Java bytecode ...