From cf401aa0b50b73fc59fbd5775ac4cd576a6e68e8 Mon Sep 17 00:00:00 2001
From: Michele Caini <michele.caini@gmail.com>
Date: Wed, 22 Jun 2022 09:00:46 +0200
Subject: [PATCH] doc: minor changes

---
 docs/md/graph.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/docs/md/graph.md b/docs/md/graph.md
index 7e3eac34c..9a3f8b860 100644
--- a/docs/md/graph.md
+++ b/docs/md/graph.md
@@ -280,7 +280,7 @@ purpose of this tool is to generate an execution graph that takes into account
 all specified constraints to return the best scheduling for the vertices:
 
 ```cpp
-entt::adjacency_matrix graph = builder.graph();
+entt::adjacency_matrix<entt::directed_tag> graph = builder.graph();
 ```
 
 The search for the main vertices, that is those without in-edges, is usually the