Ullmann算法是子图同构 问题的经典回溯算法,由J.R. Ullmann于1976年提出。它在网络图分析、化学信息学(分子结构匹配)、模式识别等领域有广泛应用。
Ullmann
01 Syntax
Microsoft.VisualBasic.Data.GraphTheory.Analysis.Ullmann
02 Methods
| Name | Overloads | Summary |
|---|---|---|
| .ctor | 1 | |
| FindIsomorphisms | 1 | get vertex node mapping result, which could be explained via the Ullmann.ExplainNodeMapping()) function. |
| ExplainNodeMapping | 1 |
03 Fields
04 Members
#ctor(
Int32()(), Int32()())Parameters
| Name | Type | Description |
|---|---|---|
largeGraphMatrix | Int32()() | target graph, should be a graph with larger vertex count |
searchGraphMatrix | Int32()() | query graph, should be a graph with smaller vertex count |
FindIsomorphisms
get vertex node mapping result, which could be explained via the Ullmann.ExplainNodeMapping() function.
T
The target graph
Q
the query graph
ExplainNodeMapping(
IEnumerable(Of Int32()), String(), String())