You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Is your feature request related to a problem? Please describe.
After implementing the DFS algorithm on a graph, the edges can be classified into 4 types namely Tree Edge, Forward Edge, Cross Edge and Backward Edges. See this
Describe the solution you'd like
DFS algorithm is already implemented . Modify it such that after the visualization is completed, the colors of edges which belong to same group should be same and different from members of any other group. The following color code can be followed:
Tree Edge: #01B878
Forward Edge: #447EAE
Backward Edge: #ED3C61
Cross Edge: #F7F700
Describe alternatives you've considered
N/A
Additional context
N/A
The text was updated successfully, but these errors were encountered:
Is your feature request related to a problem? Please describe.
After implementing the DFS algorithm on a graph, the edges can be classified into 4 types namely Tree Edge, Forward Edge, Cross Edge and Backward Edges. See this
Describe the solution you'd like
DFS algorithm is already implemented . Modify it such that after the visualization is completed, the colors of edges which belong to same group should be same and different from members of any other group. The following color code can be followed:
Describe alternatives you've considered
N/A
Additional context
N/A
The text was updated successfully, but these errors were encountered: