We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent c8d493a commit 1bed60dCopy full SHA for 1bed60d
src/data/ProjectsData.tsx
@@ -126,8 +126,8 @@ export const WukongProject: Project = {
126
question: "What is a Directed Acyclic Graph (DAG)?",
127
answer: <Stack direction={"column"} spacing={1}>
128
<Typography component={"span"}>
129
- A Directed Acyclic Graph (DAG) is a graph in which the nodes (i.e., vertices) are connected by
130
- <i>directed</i> edges (i.e., arrows), without any cycles or loops.
+ A Directed Acyclic Graph (DAG) is a graph in which the nodes (i.e., vertices) are connected
+ by <i>directed</i> edges (i.e., arrows), without any cycles or loops.
131
132
This means that you <i>cannot</i> start at a node and begin following edges (arrows) to get back
133
to the same starting node.
0 commit comments