Draft - Service Dependency Graph
Authoring skeleton - backend focus (CS113 backend graphs)
Three short topics
- Model dependencies (tasks, assignments, services) as a directed graph.
- Adjacency list representation in Java.
- Traversal (BFS/DFS) and ordering with cycle detection.
PBL context
Represent dependencies or routes as a graph and compare traversal and path-finding strategies. Context: an ordered set of assignments or service calls.
Backend layers to author
- Build an adjacency list from a small dependency list.
- BFS/DFS to find everything a node depends on.
- Topological order and cycle detection.
- Directed/weighted edge tests.
Evidence checklist to author
Test empty graph, single node, disconnected nodes, and a cycle; state the expected result for each before running.
Publication checklist
Complete examples, a CodeRunner exercise, and tests before removing the draft/hide flags, enabling submissions, or confirming the course and week.
Code Runner Challenge
Authoring draft - service dependency graph exercise is not ready
View IPYNB Source
// CODE_RUNNER: Authoring draft - service dependency graph exercise is not ready
public class DependencyGraphDraft {
public static void main(String[] args) {
throw new UnsupportedOperationException("Draft: author graph construction, traversal, and tests before publication.");
}
}
DependencyGraphDraft.main(null);
Lines: 1
Characters: 0
Output
Click "Run" in code control panel to see output ...