Is every finite category identifiable with a directed multigraph? (and vice versa?) What seems implicit in this talk on youtube, is the claim that every directed multigraph (with loops) can be identified with a finite category and vice versa, if we consider the paths of the directed multigraph rather than just the edges (= 1-edge paths).
Is this true?
If it is true, why is there not more cross-fertilization between category theory and graph theory? 


EDIT: The proposed identification:
The nodes are the objects of the finite category.
The identity morphisms are implicit (i.e. do not need to be depicted), but if they are to be depicted, then they are just a loop starting and ending at the corresponding vertex.
As stewbasic pointed out in the commented below, we need to stipulate that each edge in a path can only be traversed once. Each path should have a well-defined source and sink, so that the domain and codomain of our corresponding morphism are well-defined. We do not want to include arbitrary cycles.
Anyway, the morphisms are the paths of the directed multigraph, or the edges of the corresponding transitive closure of said multigraph (we want to interpret the arrows such that the associative rule holds, i.e. the composition of any two morphisms is again a morphism).


My guess would be that finite categories are uninteresting to the typical category theorist, not to mention 1-categories in general, and directed multigraphs are probably too pathological for the average graph theorist to care about.
Note that for this identification to work, we have to assume that the identity morphisms are implicit in the directed multigraph, but that really isn't a problem, since when composed with any other morphism they "disappear", at least in the sense that neglecting to draw the loops corresponding to the identity morphisms on the directed multigraph would not affect whether the transitive closure represents the corresponding finite category or not.


I assumed that nLab would have something to say about this, but no such luck: https://ncatlab.org/nlab/show/category+of+simple+graphs
From this page there is a clear correspondence between the transitive closure of a directed multigraph (or considering the paths of the multigraph instead of the edges) and posets, since we can define the nodes to be reflexive, antisymmetry follows from the multigraph being directed (from the nLab page it follows that symmetry for the relation implied by the multigraph holds if it is undirected), and transitivity follows from taking the transitive closure/considering paths instead of edges.
So if the above correspondence is correct, then in some sense finite categories, directed multigraphs, and posets all "coincide", essentially since they all describe the same type of relation.
I know that every monoid can be represented by a category with one object and the morphisms are just the elements of the monoid (the invertible elements being the isomorphisms).
EDIT: I think this question might be a duplicate, so I am voting to close this question. The original question did not come up in the suggestions or similar questions while writing this one, so thanks must go to Musa Al-hassy for finding and pointing out the similarity:
Is there a monoid structure on the set of paths of a graph?
 A: The path category on a graph is like a free algebra; in fact, ignoring size issues, every category can be presented as the path category modulo a congruence relation of a suitable type on the arrows.
(The morphisms in the path category are all paths; including the ones that contain cycles and repeated edges. This includes empty paths, with the caveat that an empty path still remembers where it starts and stops)
I'm not really sure what cross-fertilization would happen; that the underlying graph of a category has an edge set defining a transitive relation makes it rather degenerate from the perspective of graph theory. e.g. the shortest distance between any two objects is either $0$, $1$ or $\infty$, and I don't think I've ever seen anyone ask for an object coloring of a category.
Some things do come up, but they're more topological in nature, like whether a category is connected.

The underlying graph of a category is definitely not enough to determine the category itself.
For example, the category with one object and one nontrivial involution ($x^2 = 1$) has the same underlying graph as the category with one object and one nontrivial idempotent ($x^2=x$).
An important special case where the underlying graph does determine the category is when it is a preorder — since each homset has at most one element, it's easy to identify the product of any two composable morphisms.
A: You haven't made explicit just how you're making the identification, but I'm pretty sure the answer is no.  Let me make sure I have this right: You're saying that you take a finite directed multigraph -- meaning, I take it, a directed graph with multiple edges allowed in each direction, as well as self-loops (in multiples, of course) -- and then taking the category of paths in this graph.  (The objects are the vertices, morphisms are directed paths, identity morphism is null path, composition is concatenation.)  And then you're asking if every finite category (in the sense of having finitely many objects) is obtained this way.
The answer is no, they aren't, because in such a category, it is impossible for two non-identity morphisms to compose to the identity.  I.e., there are no nontrivial isomorphisms, not even nontrivial automorphisms.
