From 34fd1dc35b518e277c09efe86c2281825e5bc4ef Mon Sep 17 00:00:00 2001
From: Islam Adel <120587170+j-adel@users.noreply.github.com>
Date: Thu, 19 Sep 2024 18:11:00 +0200
Subject: [PATCH] Added empty simple graphs construction in construction.md
 (#399)

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

diff --git a/docs/src/first_steps/construction.md b/docs/src/first_steps/construction.md
index 31ac7d063..c08779db3 100644
--- a/docs/src/first_steps/construction.md
+++ b/docs/src/first_steps/construction.md
@@ -6,7 +6,7 @@ _Graphs.jl_ provides a number of methods for creating a graph. These include too
 
 ### Standard generators
 
-_Graphs.jl_ implements numerous graph generators, including random graph generators, constructors for classic graphs, numerous small graphs with familiar topologies, and random and static graphs embedded in Euclidean space.
+_Graphs.jl_ implements numerous graph generators, including random graph generators, constructors for classic graphs, numerous small graphs with familiar topologies, and random and static graphs embedded in Euclidean space. An empty simple Graph can be constructed using `g = SimpleGraph()` and similary `g = SimpleDiGraph()` for directed graphs.
 See [Generators for common graphs](@ref) for a complete list of available templates.
 
 ### Datasets