Struct Day09

pub struct Day09 { /* private fields */ }

2015 Day 9: Finding the shortest and longest path.

Traverse each route from the first location, adding on the edge from the last location back to the first location to find the shortest/longest loop. The shortest/longest route starting and ending at different locations is then the shortest/longest loop minus the longest/shortest edge.

Implementations

impl Day09

pub fn new(input: &str, _: InputType) -> Result<Self, InputError>

pub fn part1(&self) -> u32

pub fn part2(&self) -> u32

Trait Implementations

impl Clone for Day09

fn clone(&self) -> Day09

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for Day09

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Puzzle for Day09

const YEAR: Year

Year 2015

const DAY: Day

Day 9

impl PuzzleExamples<u32, u32> for Day09

const EXAMPLES: &'static [(&'static str, Option<u32>, Option<u32>)]