Algorithm (Workflow)

This MATLAB function, graphofEL, creates an undirected graph model from an edge list. It is designed to analyze surface models using graph theory, which is useful for understanding structures at an abstract level. The function is part of the SolidGeometry library and was introduced in version 4.0.

Input Parameters

• EL: An edge list that must contain unique entries. It represents the connections between nodes in the graph.
• n (optional): The number of vertices in the graph. If provided, it specifies the total number of nodes in the graph.

Output Results

• G: A MATLAB graph structure using edges and nodes. This structure can be used for further analysis or visualization.

Algorithm Steps

1. Check if the optional parameter n is provided. If it is, assign it to the variable n.
2. Ensure that the edge list EL contains unique rows by using the unique function.
3. If the optional parameter n is provided, create a directed graph using the digraph function with the specified number of vertices. Otherwise, create a directed graph without specifying the number of vertices.
4. If no output is requested (i.e., nargout==0), call the SGfigure function to create a new figure and use the ELplot function to plot the edge list.

Example Usage

To use the function, you can call it with an edge list obtained from the featureEdges function:

EL = featureEdges(TR3ofSG(SGsample(25)), 1);
graphofEL(EL);
graphofEL(featureEdges(TR3ofSG(SGsample(3)), 1));

This example demonstrates how to create a graph from an edge list derived from a sample surface model.