搜索资源列表
coloring_graph
- Algorithm colouring graph minimum numbers of colours. Dsatur heuristic algorithm.
coloring_graph_exact
- exact DSATUR algorithm colouring grapg minimum number of colours
beeNetColor
- 蜂窝着色问题算法代码 实现了Dsatur算法 GB-DFR和GB-DFR改进算法-failed to translate
graph-coloring
- 基于greedy DSATUR 的经典着色程序-Given a graph, vertex coloring is the assignment of colors to the vertices such that no two adjacents vertices share the same color. Vertex coloring problem is NP-hard for general graphs. However
dsatur
- DSATUR algorithme de coloration des graphe dsatur