Graph Theory Package (version 1.24) Demo
Michael Monagan, February 8th, 2006.
Updated MBM June 2006.
<Text-field style="Heading 1" layout="Heading 1">Graph and DrawGraph</Text-field>
G := Graph({{a,b},{b,c},{c,d},{d,a},{b,d}});
H := Graph({[a,b],[b,c],[c,d],[d,a],[b,d]});
T := Graph({{1,2},{2,3},{3,4},{3,5}});
N := Graph({[[1,2],3],[[1,3],2],[[2,4],3],[[3,4],4]});
P := SpecialGraphs:-PetersenGraph();
lprint(G);
print(op(5,G));
lprint(P);
print(op(5,P));
lprint(N);
IsDirected(N);
Vertices(N);
Neighbors(N);
Edges(N);
AdjacencyMatrix(N);
IsWeighted(N);
WeightMatrix(N);
DrawGraph(G);
DrawGraph(H);
DrawGraph(T);
DrawGraph(N);
DrawGraph(P);
IsPlanar(P);
EdgeConnectivity(P);
ChromaticNumber(P,'C');
C;
HighlightVertex(P,C[1],[red$4]);
HighlightVertex(P,C[2],[green$3]);
DrawGraph(P);
<Text-field style="Heading 1" layout="Heading 1">RandomNetwork, DrawNetwork, MaxFlow</Text-field>
Work done by Mahdi Javadi
G := RandomGraphs:-RandomGraph(10,10, connected);
N := RandomGraphs:-RandomNetwork(10,0.2,acyclic,weights=0.0..1.0);
DrawNetwork(N);
IsWeighted(N);
map(evalf[3],WeightMatrix(N));
IsNetwork(N);
flow,F := MaxFlow(N,1,10):
map(evalf[3],F);
<Text-field style="Heading 1" layout="Heading 1">DrawGraph(G,style=spring),
DrawGraph(G,dimension=3)</Text-field>
Show Allan's/Moe's code on a wheel graph.
n := 10;
G := Graph( { seq( [i,n], i=0..n-1 ), seq( [i,i+1 mod n], i=0..n-1 ) } );
DrawGraph(G);
DrawGraph(G,style=spring);
DrawGraph(G,dimension=3);
S := SpecialGraphs:-SoccerBallGraph();
DrawGraph(S,style=spring,dimension=3);
<Text-field style="Heading 1" layout="Heading 1">Miscellaneous</Text-field>
<Text-field style="Heading 2" layout="Heading 2">Input</Text-field>
G := Graph(Trail(1,2,3,1,4,5,1));
SetVertexPositions(G,[[0,0],[1,1],[1,-1],[-1,1],[-1,-1]]);
HighlightEdges(G,[{1,2},{2,3},{3,1}],[red,green,black]);
DrawGraph(G);