<< NL_F: Function
NARVAL
NL_I: Internet >>
NARVAL
>> NL_G: Graph
NL_G: Graph
NL_G_AddEdges
—
Add a list of new edges to a graph.
NL_G_AddNodes
—
Add a list of new nodes to a graph.
NL_G_AdjacencyMatrix
—
Compute the adjacency matrix of a graph.
NL_G_Assortativity
—
Perform the assortativity coefficient of a graph.
NL_G_AverageDistance
—
Perform the average distance of a graph.
NL_G_AverageNodeDegree
—
Perform the average node degree of a graph.
NL_G_AvgNConnectivity
—
Perform the Average Neighbor Connectivity of a graph node (degree K).
NL_G_Betweenness
—
Perform the betweenness of a node inside a graph.
NL_G_Brite2Scilab
—
Import a graph generated by the BRITE topology generator.
NL_G_ConnectionNeighbors
—
Perform the 1-Hop neighborhood of the shortest path between two network nodes in respect with a routing table.
NL_G_ConnexComponent
—
Extract the set of disjoint connex components of a graph.
NL_G_Coreness
—
Perform the coreness vector of a graph.
NL_G_CoulombForce
—
Perform the force generated by the Coulomb's repulsion between two nodes.
NL_G_DeleteEdges
—
Delete a list of edges from a graph.
NL_G_DeleteNodes
—
Delete a list of nodes from a graph.
NL_G_Diameter
—
Compute the diameter of a graph from its enhanced routing table.
NL_G_DistancePartition
—
Perform the distance distribution of a graph.
NL_G_Eccentricity
—
Compute the eccentricity of all nodes inside a graph from its enhanced routing table.
NL_G_Edge2Nodes
—
Compute the extremal nodes of an edge inside a graph.
NL_G_EdgeDataFields
—
Extract the most important edge data fields of a graph.
NL_G_EdgeNumber
—
Return the number of edges inside a graph.
NL_G_EdgesLength
—
Perform the length of each edge of a graph.
NL_G_EdgesOfNode
—
Return the set of edges connected to a node inside a graph.
NL_G_ForceBasedAlgo
—
Perform the force-based algorithm on a graph.
NL_G_GraphCenter
—
Return the center of a graph from its enhanced routing table.
NL_G_GraphConnexPart
—
Extract the largest connex component of a graph.
NL_G_GraphConnexPartI
—
Extract the
connex component a graph.
NL_G_GraphDegreeDist
—
Perform the node degree distribution of a graph.
NL_G_GraphDegreeDistPlot
—
Perform the node degree distribution of a graph (visualization).
NL_G_GraphEdgesLength
—
Weight a graph.
NL_G_GraphInit
—
Initialization of a graph.
NL_G_GraphRadius
—
Return the radius of a graph from its enhanced routing table.
NL_G_GraphSize
—
Extract the number of nodes and links of a graph.
NL_G_GraphStructure
—
Initialize a graph structure.
NL_G_GraphUnion
—
Merge two graphs in respect with a defined edge between two nodes.
NL_G_HighlightEdges
—
Highlight a set of edges within a graph.
NL_G_HighlightFldLeaves
—
Highlight the leaves of a virtual tree (Flood).
NL_G_HighlightNetwork
—
Highlight a network state in respect with the congestion level of each node.
NL_G_HighlightNodes
—
Highlight a set of nodes in a graph.
NL_G_HighlightNodesState
—
Highlight a network graph in respect with a defined metric per node.
NL_G_HighlightPath
—
Highlight a path on a graph.
NL_G_HighlightTreeLeaves
—
Highlight the leaves of a tree (BFS,BFSW,DFS,DFSW).
NL_G_HookeForce
—
Perform the force generated by the Hooke's attraction.
NL_G_InternalLinks
—
Perform the number of internal links of a set of nodes.
NL_G_JointDegreeDist
—
Perform the Joint Degree Distribution of a graph.
NL_G_KCore
—
Perform the k-core of a graph.
NL_G_LoadGraph
—
Load a graph.
NL_G_LoadGraphNE
—
Import a graph provided by the user into the Scilab environment (2 files: nodes and edges).
NL_G_LocalClustering
—
Perform the local clustering of the k-degree nodes of a graph.
NL_G_MakeGraph
—
Create a graph.
NL_G_MaximumNodeDegree
—
Perform the maximum node degree of a graph.
NL_G_MeanLocalClustering
—
Perform the mean local clustering of a graph.
NL_G_NodeClose2XY
—
Find the closest node from a geographic location.
NL_G_NodeDataFields
—
Return the most important node data fields of a graph.
NL_G_NodeNeighbors
—
Perform the neighborhood of a node within a graph.
NL_G_NodeNeighborsHT
—
Perform the 1-hop neighborhood of a network node (Head and Tail vectors).
NL_G_NodeNeighborsHTN
—
Perform the 1-hop neighborhood of a network node (extended outputs).
NL_G_NodeNumber
—
Return the number of nodes within a graph.
NL_G_NodeStructure
—
Initialize a node structure.
NL_G_Nodes2Edge
—
Return the edge index between two extremal nodes of a graph.
NL_G_Nodes2Path
—
Transform a list of nodes into the corresponding list of edges.
NL_G_OriginalGraph
—
Modify the graph parameters to their default values.
NL_G_ParametersUpdateNE
—
Update all visualization parameters of a graph.
NL_G_Path2Nodes
—
Transform a list of edges into the corresponding list of nodes.
NL_G_Periphery
—
Return the periphery of a graph from its enhanced routing table.
NL_G_RandCoordinates
—
Generate randomly the nodes' coordinates of a graph in respect with a uniform distribution.
NL_G_RichClubConnect
—
Perform the rich club connectivity of a graph.
NL_G_SaveGraph
—
Save a graph.
NL_G_ShowGraph
—
Display a graph.
NL_G_ShowGraphE
—
Display the index of each edge within a graph.
NL_G_ShowGraphEW
—
Display the weight of each edge within a graph.
NL_G_ShowGraphN
—
Display the index of each node within a graph.
NL_G_ShowGraphNE
—
Display the index of each node and edge within a graph.
NL_G_Spectrum
—
Perform the spectrum of a graph.
NL_G_SplitEdge
—
Insert new nodes inside an edge of a graph.
NL_G_Star
—
Connect new nodes around a central node.
NL_G_WCDS
—
Generate a Weakly Connected Dominating Set (WCDS) of a graph.
NL_G_WCDSChannel
—
Color a WCDS graph.
NL_G_WCDSColor
—
Color a WCDS graph (4 colors).
NL_G_WCDSNucleus
—
Perform the nucleus graph of a WCDS graph.
NL_G_WCDSNucleusChannel
—
Color the nucleus graph of a WCDS graph.
NL_G_WeightOfPath
—
Compute the total weight of a path.
Report an issue
<< NL_F: Function
NARVAL
NL_I: Internet >>