Graph

Graph({edge1,...,edgeN})

create a graph from the given edges edge1,...,edgeN.

See:

• Wikipedia - Graph
• Wikipedia - Graph theory

Examples

A directed graph:

>> Graph({1 -> 2, 2 -> 3, 3 -> 4, 4 -> 1})

An undirected graph:

>> Graph({1 <-> 2, 2 <-> 3, 3 <-> 4, 4 <-> 1})

An undirected weighted graph:

>> Graph({1 <-> 2, 2 <-> 3, 3 <-> 4, 4 <-> 1},{EdgeWeight->{2.0,3.0,4.0, 5.0}})

Related terms

GraphCenter, GraphDiameter, GraphPeriphery, GraphRadius, AdjacencyMatrix, EdgeList, EdgeQ, EulerianGraphQ, FindEulerianCycle, FindHamiltonianCycle, FindVertexCover, FindShortestPath, FindSpanningTree, GraphQ, HamiltonianGraphQ, VertexEccentricity, VertexList, VertexQ

Github

• Implementation of Graph