Move features up
This commit is contained in:
parent
79d188cfa9
commit
ab2652a67c
24
README.md
24
README.md
|
@ -20,6 +20,18 @@ It can find
|
|||
and [induced subgraph isomorphisms](https://en.wikipedia.org/wiki/Induced_subgraph_isomorphism_problem).
|
||||
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
|
||||
|
||||
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.
|
|||
|
||||

|
||||
|
||||
# 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
|
||||
|
||||
Add `vf2` to your dependencies in **Cargo.toml**.
|
||||
|
|
Loading…
Reference in New Issue