https://github.com/ahajha/spang
An implementation of gSpan in C++20
https://github.com/ahajha/spang
Last synced: 2 months ago
JSON representation
An implementation of gSpan in C++20
- Host: GitHub
- URL: https://github.com/ahajha/spang
- Owner: Ahajha
- License: mit
- Created: 2021-05-23T11:41:37.000Z (about 4 years ago)
- Default Branch: main
- Last Pushed: 2024-12-25T07:00:06.000Z (5 months ago)
- Last Synced: 2024-12-25T07:30:26.653Z (5 months ago)
- Language: C++
- Homepage:
- Size: 135 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# spang
An implementation of gSpan in C++20
## Input format
```
t #
v
...
e
...
t #
...
```
Takes a list of graphs, with each graph starting with `t #` followed by its ID (an integer). The graph is then followed by its list of vertices (each starting with `v`) and list of edges (each starting with `e`). All IDs and labels must be integers, and may be negative. IDs may be in any order, though it is generally simpler to order them sequentially from 0. Comments may be added by starting a line with "#".
## Output format
```
t # *
v
...
e
...
[x: ]
t # *
...
```
Outputs a list of subgraphs that are frequent, along with their support and, optionally, the list of input graphs that this subgraph occurs in.