articulation-points

Design and Analysis of Algorithms (DAA) – Articulation Point Analysis (PBL). A Java CLI project to study network reliability using Tarjan‑style DFS articulation point detection, CSV input, scale‑free graph generation, and optional HTML visualization for interactive analysis.

Network topology analysis tool implementing Tarjan's strongly connected components algorithm.

[hackathon] Autonomous strategy bot with a real-time Flask dashboard for the DatsSol game — DatsTeam hackathon 2026, 16th of 166

Interactive visualiser and tutor for the DFS low-link techniques: articulation points, bridges, biconnected components, block-cut trees and strongly connected components (Tarjan's). Step-by-step playback, predict mode, quizzes and an editable graph canvas.

C and Java Swing graph applications for MST, shortest path, articulation points, and verification.

Biblioteca de grafos não-direcionados e ponderados em C99: lê o grafo de stdin e calcula componentes conexas, bipartição, diâmetro de cada componente (duplo Dijkstra), vértices de corte e pontes (DFS com low-link). Lista de adjacência, sem dependências além da libc.