what is fullness in category theory?

I am looking at the category of graphs. I am learning that if we have a morphism between 2 graphs (where the graphs come via an insertion from the endomaps of sets), then the map itself comes from the insertion from a map in the category of endomaps. They call this fullness. Is it possible to give an example that explains this more clearly? I am not clear on what this means.

-

Let $S$ be a subcategory of a category $C$. We say that $S$ is a full subcategory of $C$ if for each pair of objects $X$ and $Y$ of $S$ we have $$\operatorname{Hom}{}_S(X,Y) = \operatorname{Hom}{}_C(X,Y)$$
In other words, a subcategory $S \subset C$ is full if the morphisms of $S$ coincide with the ones from $C$.