-
-
Notifications
You must be signed in to change notification settings - Fork 7.7k
Closed
Labels
enhancementNew feature or requestNew feature or requeststaleAuthor has not responded to the comments for over 2 weeksAuthor has not responded to the comments for over 2 weeks
Description
Most of the algorithms in the graph folder implement their own representation of the graph structure and very often it is quite similar piece of the code.
Detailed Description
- Build a new header-only library in
graphfolder that will contain a class for storing a graph as an adjacency list. - Use the structure to pass the graph object as a parameter for graph algorithms in the folder
Context
Pointed out in #986 as a desirable thing to have to reduce the code duplication and also contributes to #909
Possible Implementation
I believe the implementation in cycle_check_directed_graph.cpp might be a good start
Metadata
Metadata
Assignees
Labels
enhancementNew feature or requestNew feature or requeststaleAuthor has not responded to the comments for over 2 weeksAuthor has not responded to the comments for over 2 weeks