TransitiveQ[g] yields True if graph g defines a transitive relation.

TravelingSalesmanBounds[g] gives upper and lower bounds on a minimum-cost traveling salesman tour of graph g.

WeaklyConnectedComponents[g] gives the weakly connected components of directed graph g as lists of vertices.

Here are a few examples that demonstrate building user interfaces with the GUIKit framework. Hello World—The classic simple application written with GUIKit. Simple Slider

PopupWindow[expr, contents] displays as expr, but pops up a window containing contents when clicked.

EulerianQ[g] yields True if graph g is Eulerian, meaning there exists a tour that includes each edge exactly once.

HamiltonianQ[g] yields True if there exists a Hamiltonian cycle in graph g, or in other words, if there exists a cycle that visits each vertex exactly once.

VertexConnectivityGraph[g] returns a directed graph that contains an edge corresponding to each vertex in g and in which edge-disjoint paths correspond to vertex-disjoint ...

Conjunction[expr, {a_1, a_2, ...}] gives the conjunction of expr over all choices of the Boolean variables a_i.

LocatorPane[{x, y}, back] represents a pane with a locator at position {x, y} and background back.LocatorPane[Dynamic[pt], back] takes the locator position to be the ...