A hand-crafted wedding website with custom typography, a soft color palette, and a React + TypeScript build.

Alexandra Hernandez

A custom wedding website built with with React, TypeScript, and Tailwind CSS, using shadcn/ui for component architecture and React Router for client-side navigation. Designed a cohesive visual identity with complementary color palette, paired with custom typography (Mrs Eaves Petite Caps/Roman and Antura Script) for an editorial, hand-lettered feel. Deployed via GitHub Pages with a custom domain routed through Cloudflare, including a BrowserRouter and 404 fallback approach to support clean client-side routing on static hosting.

Source code can be found [here](https://github.com/alexandrarh/wedding-website).


A custom-built RSVP and planning platform powered by Django and PostgreSQL, with automated guest communication.

A full-stack web application built with Django and PostgreSQL to manage wedding planning and guest RSVPs end-to-end, as a means to avoid costly pre-built planners. Designed and implemented the RSVP workflow along with backend logic for guest management, deployed on Railway with a custom domain configured through Cloudflare. Integrated Resend for automated email notifications, handling confirmations and updates throughout the RSVP process.

Source code can be found [here](https://github.com/alexandrarh/wedding-planner/).


Wedding Planner and RSVP Form

C++ program that creates a graph using customized classes with basic properties as well as returning the shortest paths from parameterized nodes using different algorithms.

This program reads a provided `.csv` file, a creates a comprehensive graph using C++'s data structure library (`tuple` , `vector` , `queue` , etc.). Utilizing custom classes to implement the graph, it helps represent a complex network of relationships using node and edge management, eventually going beyond basic representation and implementing traversal algorithms to return the shortest defined paths. With algorithms such as Breadth-First Search (BFS), Depth-First Search (DFS), and Dijkstra's algorithm, each traversal returns the specific path based on the provided node. Additionally, the implementation incorporates disjoint set operations with union functionality, providing a robust toolkit for graph analysis and manipulation. Through carefully designed classes and methods, the program enables users to explore graph properties, perform sophisticated network traversals, and solve complex pathfinding problems with efficiency and precision.

Original picture is accessible [here](https://www.google.com/url?sa=i\&url=https%3A%2F%2Fpython.plainenglish.io%2Fgraph-theory-23468908321d\&psig=AOvVaw3fSJb5_xGU00FXbapEXVrz\&ust=1734233876001000\&source=images\&cd=vfe\&opi=89978449\&ved=0CBcQjhxqFwoTCICN2eOqpooDFQAAAAAdAAAAABAZ).
