B:BD[
3.300] → [
3.300:335]
B:BD[
3.488] → [
3.488:586]
2. determine flavor of each center
3. write BFS double-flow algorithm to determine flavor of non-centers
4. re-weight highway connections (approxmiately 5x, some random variation)
5. based on the type of node (highway vs local vs deadend) assign actual stats
6. render a user's stats and stat formula
7. allow user to allocate points and update their stats
1. determine flavor of each center
1. write BFS double-flow algorithm to determine flavor of non-centers
1. re-weight highway connections (approxmiately 5x, some random variation)
1. based on the type of node (highway vs local vs deadend) assign actual stats
1. render a user's stats and stat formula
1. allow user to allocate points and update their stats