Version: 0.3
C++ implementation of FocusSearch (originally implemented in Modula2 by Ullmann)
Before use the FocusSearch-C++ command line interface of all distributions, please rebuilt it by make -B The tool usage is:
./fsearch ISO_TYPE INPUT_FORMAT target_graph pattern_graph
| ISO_TYPE | specify isomorphism |
|---|---|
| mono | monomorphism, the classical subgraph matching |
| INPUT_FORMAT | specify input file format |
|---|---|
| gfd | directed graphs with attributes only on nodes. |
| gfu | undirected graphs with attributes only on nodes. |
| vfu | Sansone et al. file format for labeled directed graphs with attributes only on nodes. |
The RI project provides two graph file format gfu and gfd, respectively for undirected and directed graphs with attributes only on nodes.
Graphs are stored in text files containing one or more items. The current input format allows the description of undirect graphs with labels on nodes.
#[graph_name]
[number of nodes]
[label_of_first_node]
[label_of_second_node]
...
[number of edges]
[node id] [node id]
[node id] [node id]
...
Node ids are assigned following the order in which they are written in the input file, starting from 0. [graph_name] and labels can not contain blank characters (spaces). Labels are case sensitive.
An example of input file is the following:
#my_graph
4
A
B
C
Br
5
0 1
2 1
2 3
0 3
0 2
Indeed, an example of input file in geu format (undirected graph with labels both on nodes and attibutes) is:
#my_graph
4
A
B
C
Br
5
0 1 a
2 1 n
2 3 m
0 3 k
0 2 a