\section{trans\+\_\+list\+\_\+s Struct Reference}
\label{structtrans__list__s}\index{trans\+\_\+list\+\_\+s@{trans\+\_\+list\+\_\+s}}


Adjacency list (opaque) for a state in an F\+S\+G.  


\subsection*{Data Fields}
\begin{DoxyCompactItemize}
\item 
{\bf hash\+\_\+table\+\_\+t} $\ast$ {\bfseries null\+\_\+trans}\label{structtrans__list__s_a15223c70915f916f5656627985c6fd39}

\item 
{\bf hash\+\_\+table\+\_\+t} $\ast$ {\bfseries trans}\label{structtrans__list__s_ade18f3313bc542cee585f0c5c16de96a}

\end{DoxyCompactItemize}


\subsection{Detailed Description}
Adjacency list (opaque) for a state in an F\+S\+G. 

Actually we use hash tables so that random access is a bit faster. Plus it allows us to make the lookup code a bit less ugly. 

Definition at line 63 of file fsg\+\_\+model.\+c.



The documentation for this struct was generated from the following file\+:\begin{DoxyCompactItemize}
\item 
src/libsphinxbase/lm/fsg\+\_\+model.\+c\end{DoxyCompactItemize}
