README excerpt
# Pharo Graph Basics
This repository contains a basic implementation of graph data structures and traversal algorithms (BFS and DFS) in Pharo Smalltalk.
## Features
- Graph using adjacency list
- Breadth-First Search (BFS)
- Depth-First Search (DFS)
- Unit tests using SUnit
## Example
Graph:
1 → 2, 3
2 → 4
BFS from 1 → [1, 2, 3, 4]
## Motivation
This project is part of my preparation for GSoC with Pharo, focusing on understanding object-oriented design and graph algorithms in Smalltalk.
## Status
Work in progress