The original algorithm is applicable to undirected, weighted and unweighted graphs. Effects coding can either be weighted or unweighted. Unlike the unweighted version, there is no greedy solution to the weighted activity selection problem. Efficiency can also be used to determine cost-effective structures in weighted and unweighted networks. The average high school GPA for the class of 2019 was an unweighted 3.71. Students' grade point averages are calculated on an unweighted 4.0 scale. Actions include commitment to a sport, club, or having a 3.0 or better unweighted GPA. In an "unweighted bipartite graph", the optimization problem is to find a maximum cardinality matching. The unweighted Carli method overstates inflation rates. Kirchhoff's theorem can be generalized to count k component spanning forests in an unweighted graph. The simplest smoothing algorithm is the "rectangular" or "unweighted sliding-average smooth". Consider an unweighted directed graph formula 1 with the set of vertices formula 2. Borgatti developed a simplified formula to calculate effective size for unweighted networks. In the case of unweighted but directed graphs, strong inapproximability results are known. In unweighted isometrics the exerciser uses only themselves for resistance.