A directed graph (or digraph) consists of a finite vertex set V and a set of ordered edges E ⊆ V × V , each edge (u, v) indicating a one-way connection from u (source) to v (target). A bidirected graph is a generalization of an undirected graph where each edge is assigned a direction at each of its endpoints independently, allowing more expressive edge orientation. A multidirected graph is a structure with vertices and edges, where edges may repeat, sources and targets are assigned, and multiplicities recorded. A molecular graph models a molecule with atoms as vertices and bonds as edges, representing its structural connectivity. In this paper, we examine definitions such as molecular bidirected graphs and multidirected graphs. These are concepts that extend molecular graphs by incorporating directional information.