@@ -20,7 +20,7 @@ public MColorResult<T, C> Color(IGraph<T> graph, C[] colors)
20
20
{
21
21
if ( ! progress . ContainsKey ( vertex ) )
22
22
{
23
- canColor ( vertex , colors ,
23
+ colorRecursively ( vertex , colors ,
24
24
progress ,
25
25
new HashSet < IGraphVertex < T > > ( ) ) ;
26
26
}
@@ -50,7 +50,7 @@ public MColorResult<T, C> Color(IGraph<T> graph, C[] colors)
50
50
/// <summary>
51
51
/// Assign color to each new node.
52
52
/// </summary>
53
- private Dictionary < IGraphVertex < T > , C > canColor ( IGraphVertex < T > vertex , C [ ] colors ,
53
+ private Dictionary < IGraphVertex < T > , C > colorRecursively ( IGraphVertex < T > vertex , C [ ] colors ,
54
54
Dictionary < IGraphVertex < T > , C > progress , HashSet < IGraphVertex < T > > visited )
55
55
{
56
56
foreach ( var item in colors )
@@ -75,7 +75,7 @@ private Dictionary<IGraphVertex<T>, C> canColor(IGraphVertex<T> vertex, C[] colo
75
75
continue ;
76
76
}
77
77
78
- canColor ( edge . TargetVertex , colors , progress , visited ) ;
78
+ colorRecursively ( edge . TargetVertex , colors , progress , visited ) ;
79
79
}
80
80
}
81
81
0 commit comments