next up previous contents
Next: Graph Views Up: Graphs Previous: Graph Vertex Information

Graph Queries



   (binary? graph )



Returns #t if graph is not a hypergraph.









   (multigraph? graph )



Returns #t if graph is of a type allowing multiple edges.









(<mbingraph*>? graph )  
(<mubingraph*>? graph ) (<mdbingraph*>? graph )  
(<mhypergraph*>? graph ) (<muhypergraph*>? graph )  
(<mdhypergraph*>? graph ) (<bingraph*>? graph )  
(<ubingraph*>? graph ) (<dbingraph*>? graph )  
(<hypergraph*>? graph ) (<uhypergraph*>? graph )  
(<dhypergraph*>? graph )  



Returns #t if graph is of the appropriate type.








  
Figure 9.1: Vertex neighbors
\begin{figure}
\begin{flushleft}
\hrulefill

\begin{alltt}
\relax
STk\gt {\bf (d...
 ...3\(\}\)
\(\char93 \)f} }
\relax\end{alltt}
\hrulefill\end{flushleft}\end{figure}


  
Figure 9.2: Vertex neighbors, directed graphs
\begin{figure}
\begin{flushleft}
\hrulefill

\begin{alltt}
\relax
STk\gt {\bf (d...
 ...4\(\}\)
\(\char93 \)f} }
\relax\end{alltt}
\hrulefill\end{flushleft}\end{figure}


  
Figure 9.3: Finding attributes
\begin{figure}
\begin{flushleft}
\hrulefill

\begin{alltt}
\relax
STk\gt {\bf (d...
 ... ''black'' ''black'')} }
\relax\end{alltt}
\hrulefill\end{flushleft}\end{figure}


  
Figure 9.4: Manipulating attributes
\begin{figure}
\begin{flushleft}
\hrulefill

\begin{alltt}
\relax
STk\gt {\bf (d...
 ...'' ''red'' ''black'')} }
\relax\end{alltt}
\hrulefill\end{flushleft}\end{figure}


next up previous contents
Next: Graph Views Up: Graphs Previous: Graph Vertex Information
RHS Linux User
1/26/1998