solve reachability problems on graph using 2 pairs of tags
this program is proposed to solve reachability problems. It accelerate dfs using 2 pairs of tags on
each node, namely Lin and Lout. The format of input can be viewed in sample*.txt and lubm.g, the
program can be run on lubm.g now.
The source code files are:
Util.h
Util.cpp
BiLabel.h
BiLabel.cpp
main.cpp
-
Notifications
You must be signed in to change notification settings - Fork 0
Gnaiqing/BiLabel
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
solve reachability problems on graph using 2 pairs of tags
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published