Java Chart Library for comparing 2 charts

Question

Does anyone know a good Java library for comparing graphs by finding the maximum common subgraph isomorphism to get information about their similarity? I do not want to compare graphs based on node labels. Or is there another way to topologically compare graphs with good Java libraries? Now I am using the SimPack library and it is useful, but I need something else. Any suggestions would be very helpful.

Answer 1

After some review, I found C ++ code that implements several matching algorithms (Shmidt-Druffel, Ullman, VF, VF2) without the need for labeling edges or node. SimPack uses the Valiente algorithm, which seems to be (I did not find a good description), the graph attribute is specific. If you rewrite this in Java or write a JNI library to interact with it, make it publicly available.

See http://amalfi.dis.unina.it/graph/db/vflib-2.0

A good overview of the current state of the art can be found in the article by the authors of the above code: " Thirty years of harmonization of the schedule in the recognition template "

Answer 2

You can get answers to this question. Good library of Java graph algorithms?

Multiple Java Graph Libraries: JGraph Graph Visualization Library

Java Graph Algorithm Library JGraphT

If you are not working, you probably want to organize the diagrams using the structure as shown below and run the algorithm on it.

public class Node<T> { public T NodeData; public List<Edge> edges; } public class Edge { public Node<S> Source; public Node<D> Destination; public int weight; }