图的实现由Graph类完成。类中，图数据结构采用邻接 表实现。邻接链表中的节点用一个数据对表示，第一个域 用来保存和连接第i个节点边的另一端的节点编号，第二个 域用来保存该边的权值。另外用一个辅助数组来存储各节点 的评分值。-Figure achieved by the Graph class is completed. Class, graph data structure using adjacency Table implementation. Adjacen

An implementation of Genetic Algorithm using java. This specifically for Independent set in graph. But you can use it for your own usage by changing fitnessCalc class.-An implementation of Genetic Algorithm using java. This is specifically for Indepe