相鄰不同色的塗色問題。這裡所用到的算法來自「舊的塗色問題、新的計算方法」。
A vertex coloring is an assignment of colors to each vertex of a graph such that no edge connects two identically colored vertices.
-
Notifications
You must be signed in to change notification settings - Fork 0
相鄰不同色的塗色問題。這裡所用到的算法來自「舊的塗色問題、新的計算方法」。A vertex coloring is an assignment of colors to each vertex of a graph such that no edge connects two identically colored vertices.
pegasusroe/VertexColoring
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
相鄰不同色的塗色問題。這裡所用到的算法來自「舊的塗色問題、新的計算方法」。A vertex coloring is an assignment of colors to each vertex of a graph such that no edge connects two identically colored vertices.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published