uzluisf

unit module ProjectFour;

=begin pod
=TITLE ProjectFour
=SUBTITLE Find a route in map by backtracking using a Stack 

The module C<ProjectFour> implements two classes (C<City> and C<RouteMap>)
to find a route, if one exists, from an origin city to a destination city,
given a particular map. In a map, a city B is adjacent to a city A if there's
an arrow pointing from A to B. For example, in N->Q we say that Q is adjacent

uzluisf

% Resources: 
% http://www-math.mit.edu/~psh/exam/examdoc.pdf
% https://www.math.uni-bielefeld.de/~rost/amslatex/doc/amsthdoc.pdf

\documentclass[addpoints,answers,12pt]{exam} % exam class with 12 point type
\usepackage[T1]{fontenc}                     % replace default font encoding (OT1)
\usepackage{tgschola}                        % font used in the Book of Proof
\usepackage{amsmath,amsthm,amssymb,amsfonts} % packages for mathematical typesetting
\usepackage{pdfpages}                        % include pdf pages with \includepdf{dir/of/page.pdf}
\usepackage[makeroom]{cancel}                % display expressions as cancelled 

uzluisf

Let's say I have the following module:

module Simple-Mod;

#| Calculate the nth fibonacci number.
multi fib( 0 ) { 1 }
multi fib( 1 ) { 1 }
multi fib( Int $n where * > 1 ) {
    fib($n - 2 ) + fib($n - 1);

uzluisf

Syncing

pacman -Sy          #sync the database

pacman -Syy         #sync the database even if it's up to date

Updating