Skip to content

Refactor: Expose standalone advanced graph algorithm options in TUI menu (PR 4)#870

Merged
darshan2456 merged 5 commits into
darshan2456:mainfrom
Akshatshukla-25:feature/tui-menu-expose
Jul 17, 2026
Merged

Refactor: Expose standalone advanced graph algorithm options in TUI menu (PR 4)#870
darshan2456 merged 5 commits into
darshan2456:mainfrom
Akshatshukla-25:feature/tui-menu-expose

Conversation

@Akshatshukla-25

Copy link
Copy Markdown
Contributor

Description

This PR refactors the interactive TUI menu (tui/tui.c) to expose all 7 individual advanced graph algorithms directly in the menu list. This allows users to select, step through, and run each specific algorithm directly from the main TUI instead of navigating through intermediate selection sub-menus.

Resolves

Exposed Options in TUI

  • Tarjan's SCC (tarjan_scc_demo)
  • Kosaraju's SCC (kosaraju_scc_demo)
  • Ford-Fulkerson Max Flow (ford_fulkerson_demo)
  • Edmonds-Karp Max Flow (edmonds_karp_demo)
  • Dinic's Max Flow (dinic_demo)
  • Bipartite Matching (Dinic) (dinic_bipartite_matching_demo)
  • Bipartite Matching (Hopcroft-Karp) (hopcroft_karp_demo)

Verification & Testing

  • Successfully compiled using make.
  • Ran unit tests with make test and confirmed all existing tests pass without issues.

@darshan2456
darshan2456 merged commit a27263a into darshan2456:main Jul 17, 2026
1 check passed
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Projects

None yet

Development

Successfully merging this pull request may close these issues.

Refactor: Decouple consolidated Advanced Graph Algorithm demos into standalone interactive routines

2 participants