Common graph path finder
This is implementation of method which takes root-node and two specified nodes from one tree-graph as params and computes the minimal common parent node of last two nodes.
-
Notifications
You must be signed in to change notification settings - Fork 0
airleks/graph
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
About
Common graph path finder
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published