我正在尝试将图中的循环替换为一组顶点(删除这个循环,并将具有最大数量的顶点放在那里)
struct group {
int master; // representative of cycle
};
struct vertex {
int *to; // neighbor list
int nb; // how many neighbor
int p; // parent
short v; // was visited? 0 = false, 1 = true
struct group *cycle; // is part of cycle
我已经安装了RAID-5阵列磁盘,但是最近有一个硬盘正在重新分配过多的扇区:
(重新分配扇区= 323)
# tw_cli /c0/p1 show all
/c0/p1 Status = OK
/c0/p1 Model = ST31000340NS
/c0/p1 Firmware Version = SN05
/c0/p1 Serial = 9QJ17SNX
/c0/p1 Capacity = 931.51 GB (1953525168 Blocks)
/c0/p1 Reallocated Sectors = 323
/c0/p1 Power On Hours = 49638
/c0/p1