This README presents the structure of the Weighted SafeSet Instances used in the paper: "A new formulation for the Safe Set problem on graphs".
Each instance is presented as follow:
<Number of Nodes> #In every instance the nodes are labeled from 0 to "Number of Nodes" - 1.
<Number of Edges>
<i,j> For each edge, their extreme points are presented in the same line.
<w> For each node, its weight is presented per line.