Main Content

La traduction de cette page n'est pas à jour. Cliquez ici pour voir la dernière version en anglais.

Algorithmes de graphes et de réseaux

Graphes orientés et non orientés, analyse de réseaux

Les graphes modélisent les connexions d’un réseau. Ils sont largement applicables à divers systèmes physiques, biologiques et aux systèmes d’information. Il est possible d’utiliser des graphes pour modéliser les neurones d’un cerveau, les itinéraires de vol d’une compagnie aérienne et bien plus encore. La structure d’un graphe se compose de « nœuds » et d’« arêtes ». Chaque nœud représente une entité. Chaque arête représente une connexion entre deux nœuds. Pour plus d’informations, consultez Directed and Undirected Graphs.

Example plots of undirected and directed graphs

Fonctions

développer tout

graphGraph with undirected edges
digraphGraph with directed edges
addnodeAdd new node to graph
rmnodeRemove node from graph
addedgeAdd new edge to graph
rmedgeRemove edge from graph
flipedgeReverse edge directions
numnodesNumber of nodes in graph
numedgesNumber of edges in graph
findnodeLocate node in graph
findedgeLocate edge in graph
edgecountNumber of edges between two nodes
reordernodesReorder graph nodes
subgraphExtract subgraph
centralityMeasure node importance
conncompConnected graph components
biconncompBiconnected graph components
condensationGraph condensation
bctreeBlock-cut tree graph
toposortTopological order of directed acyclic graph
isdagDetermine if graph is acyclic
transreductionTransitive reduction
transclosureTransitive closure
isisomorphicDetermine whether two graphs are isomorphic
isomorphismCompute isomorphism between two graphs
ismultigraphDetermine whether graph has multiple edges
simplifyReduce multigraph to simple graph
bfsearchBreadth-first graph search
dfsearchDepth-first graph search
shortestpathShortest path between two single nodes
shortestpathtreeShortest path tree from node
distancesShortest path distances of all node pairs
allpathsFind all paths between two graph nodes (depuis R2021a)
maxflowMaximum flow in graph
minspantreeMinimum spanning tree of graph
hascyclesDetermine whether graph contains cycles (depuis R2021a)
allcyclesFind all cycles in graph (depuis R2021a)
cyclebasisFundamental cycle basis of graph (depuis R2021a)
adjacencyGraph adjacency matrix
incidenceGraph incidence matrix
laplacianGraph Laplacian matrix
degreeDegree of graph nodes
neighborsNeighbors of graph node
nearestNearest neighbors within radius
indegreeIn-degree of nodes
outdegreeOut-degree of nodes
predecessorsNode predecessors
successorsNode successors
inedgesIncoming edges to node
outedgesOutgoing edges from node
plotPlot graph nodes and edges
labeledgeLabel graph edges
labelnodeLabel graph nodes
layoutChange layout of graph plot
highlightHighlight nodes and edges in plotted graph

Objets

GraphPlotGraph plot for directed and undirected graphs

Propriétés

GraphPlot PropertiesGraph plot appearance and behavior

Rubriques

Informations connexes

Exemples présentés