Oriented graph VS directed graph?
Alright, while the definitions are stated in my lecure notes, textbooks and wiki, I'll be honest, it just explodes my mind with what seems like word sorcery.
Definition
A directed graph is called an oriented graph if it is the orientation of an undirected graph.
What are the distinctions between Oriented graphs and digraphs?
An oriented graph is a directed graph with orientation?
But isn't "directed" already standing for being "oriented?" I just don't get it, "oriented" and "directed" seems like an interchange between "PC" and "laptop", it seems like it's just another way of saying it.
How can something be directed but not oriented and vice versa?
Where can you find a casual explanation between the distinction?
An oriented graph is an undirected graph with orientation.
Think of it this way, every oriented graph is a directed graph, but not viceversa.
Every oriented graph can be obtained by taking a simple undirected graph and assigning a direction to every edge. This is not true for every directed graph.
Basically directed graphs can have an arrow going from $A$ to $B$ and an arrow going from $B$ to $A$. oriented graphs can have at most one arrow between any two vertices $A$ and $B$.
This image shows a directed graph which is not an oriented graph, it is not oriented because it contains an arrow from $(2,2)$ to $(1,1)$ and an arrow going from $(1,1)$ to $(2,2)$. (Image taken from wikimedia commons)
Shortly
"an oriented graph is a digraph without multiple edges or loops"
more can be found in Diestel, Graph Theory book (p.28 in 2005 Electronic edition).