From 02ca008341f72bed4c749776a4ccb69bd6211eac Mon Sep 17 00:00:00 2001
From: Spiros Maggioros <spirosastro@gmail.com>
Date: Sat, 20 Jan 2024 19:15:38 +0200
Subject: [PATCH] minor change for dfs/bfs

minor change when element is not in graph when dfs/bfs-ing.
---
 src/classes/graph/graph.h | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

diff --git a/src/classes/graph/graph.h b/src/classes/graph/graph.h
index ec12dfa4..c073a19d 100644
--- a/src/classes/graph/graph.h
+++ b/src/classes/graph/graph.h
@@ -89,7 +89,7 @@ template<typename T> size_t graph<T>::size(){return __elements.size();}
 
 template <typename T> std::vector<T> graph<T>::dfs(T start) {
   std::vector<T> path;
-  if(this -> empty()){
+  if(this -> empty() || __elements.find(start) == __elements.end()){
     return path;
   }
   std::stack<T> s;
@@ -112,7 +112,7 @@ template <typename T> std::vector<T> graph<T>::dfs(T start) {
 
 template <typename T> std::vector<T> graph<T>::bfs(T start) {
   std::vector<T> path;
-  if(this -> empty()){
+  if(this -> empty() || __elements.find(start) == __elements.end()){
     return path;
   }
   std::queue<T> q;
@@ -400,7 +400,7 @@ template <typename T> int64_t weighted_graph<T>::shortest_path(T start, T end) {
 template <typename T> std::vector<T> weighted_graph<T>::dfs(T start) {
 
   std::vector<T> path;
-  if(this -> empty()){
+  if(this -> empty() || __elements.find(start) == __elements.end()){
     return path;
   }
   std::queue<T> q;
@@ -426,7 +426,7 @@ template <typename T> std::vector<T> weighted_graph<T>::dfs(T start) {
 
 template <typename T> std::vector<T> weighted_graph<T>::bfs(T start) {
   std::vector<T> path;
-  if(this -> empty()){
+  if(this -> empty() || __elements.find(start) == __elements.end()){
     return path;
   }
   std::queue<T> q;