gives the graph with vertices vi and edges from vi to vj whenever f[vi,vj] is True.
Details and Options
- RelationalGraph takes the same options as Graph.
- The option DirectedEdges can be used to control whether an undirected or directed graph is constructed.
- The following settings for DirectedEdges can be used in RelationalGraph:
Automatic undirected graph if crit[vi,vj]==crit[vj,vi] True construct a directed graph False construct an undirected graph
Examplesopen allclose all
RelationGraph works with any binary Boolean function:
RelationGraph works with any expression including integers:
Use Placed with symbolic locations to control label placement along an edge:
Get a list of built-in settings for EdgeShapeFunction:
Use Placed with symbolic locations to control label placement, including outside positions:
Get a list of built-in collections for VertexShapeFunction:
Use built-in settings for VertexShapeFunction in the "Basic" collection:
Use built-in settings for VertexShapeFunction in the "Rounded" collection:
Use built-in settings for VertexShapeFunction in the "Concave" collection: