edoc.jung - To Compare Graphs

How to Compare Graphs

[Compare Graphs]

This page is only in English

edoc.jung is able to compare two graphs

It is an add-on to JUNG. The add-on allows:

compare two graphs numerically ('matching' module),
extend the set of vertices in graph in order to get connected subgraph ('connectedsubgraph' module).

The function GraphComparator.compare() takes two graphs as arguments and calculates distance between graphs taking into account:

Names of nodes (using Levenshtein distance),
Structure of graphs.

Online demo

Click WebStart application to compare graphs. It is an example of integration of JUNG and WebStart application.

Graphs are presented in Pajek format. Downoad Pajek 1.15 or later in order to create your own graphs and compare them (use "Browse..." buttons). There are examples of graphs in Pajek format:

4_triangle_computer.net
5_mobile_phone.net
simple.net
smyth.net

Download

all files (with JUNG 1.7.6): edoc.jung-0.1.zip (2 454 Kb), see list of changes in JUNG.
only sources edoc.jung-0.1.src.zip (82 Kb).