berkus
/
vf2
mirror of https://github.com/OwenTrokeBillard/vf2.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Move features up

This commit is contained in:
Owen Troke-Billard 2024-09-17 21:44:21 -06:00
parent 79d188cfa9
commit ab2652a67c
1 changed files with 12 additions and 12 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

24
README.md
View File

@ -20,6 +20,18 @@ It can find
and [induced subgraph isomorphisms](https://en.wikipedia.org/wiki/Induced_subgraph_isomorphism_problem). and [induced subgraph isomorphisms](https://en.wikipedia.org/wiki/Induced_subgraph_isomorphism_problem).
Graphs can be directed or undirected. Graphs can be directed or undirected.
# Features
- [x] Enumerate graph isomorphisms
- [x] Enumerate subgraph isomorphisms
- [x] Enumerate induced subgraph isomorphisms
- [x] Support directed graphs
- [x] Support undirected graphs
- [x] Support disconnected graphs
- [x] Support node labels
- [x] Support edge labels
- [x] Graph trait
# Motivation # Motivation
Subgraph matching is the task of finding instances of a query graph within a larger data graph. It is useful when Subgraph matching is the task of finding instances of a query graph within a larger data graph. It is useful when
@ -58,18 +70,6 @@ the data subgraph must also exist in the query graph.
![induced-subgraph-isomorphism.svg](/images/induced-subgraph-isomorphism.svg) ![induced-subgraph-isomorphism.svg](/images/induced-subgraph-isomorphism.svg)
# Features
- [x] Enumerate graph isomorphisms
- [x] Enumerate subgraph isomorphisms
- [x] Enumerate induced subgraph isomorphisms
- [x] Support directed graphs
- [x] Support undirected graphs
- [x] Support disconnected graphs
- [x] Support node labels
- [x] Support edge labels
- [x] Graph trait
# Usage # Usage
Add `vf2` to your dependencies in **Cargo.toml**. Add `vf2` to your dependencies in **Cargo.toml**.