takes a set partition l of vertices and returns an embedding of the vertices in the plane such that the vertices in each block occur on a vertical line with block 1 vertices on the leftmost line, block 2 vertices in the next line, and so on.
takes a graph and a set partition l of the vertices of and returns the graph with vertices embedded according to RankedEmbedding[l].
takes a graph and a set s of vertices of and returns a ranked embedding of in which vertices in s are in block 1, vertices at distance 1 from any vertex in block 1 are in block 2, and so on.
- Computation on Graphs
- Discrete Mathematics
- Displaying Graphs
- Graph Construction & Representation
- Graph Operations and Modifications
- Graph Properties
- Graph Properties & Measurements
- Graphs and Matrices
- Graphs & Networks
- Graph Visualization
- Mathematical Data Formats
- Statistical Analysis
- Social Network Analysis