grafos.mws

GRAFOS

10 de Novembro de 2007

>    with(networks);

[acycpoly, addedge, addvertex, adjacency, allpairs, ancestor, arrivals, bicomponents, charpoly, chrompoly, complement, complete, components, connect, connectivity, contract, countcuts, counttrees, cube...
[acycpoly, addedge, addvertex, adjacency, allpairs, ancestor, arrivals, bicomponents, charpoly, chrompoly, complement, complete, components, connect, connectivity, contract, countcuts, counttrees, cube...
[acycpoly, addedge, addvertex, adjacency, allpairs, ancestor, arrivals, bicomponents, charpoly, chrompoly, complement, complete, components, connect, connectivity, contract, countcuts, counttrees, cube...
[acycpoly, addedge, addvertex, adjacency, allpairs, ancestor, arrivals, bicomponents, charpoly, chrompoly, complement, complete, components, connect, connectivity, contract, countcuts, counttrees, cube...

Construção de um grafo

>    G1 := new():

>    addvertex({Coimbra, Lisboa, Porto, Faro, Aveiro, Évora, Braga},G1);

Coimbra, Lisboa, Porto, Faro, Aveiro, `Évora`, Braga

>    addedge({{Coimbra,Lisboa},{Coimbra,Porto},{Coimbra,Aveiro},{Évora,Faro},{Lisboa,Porto},{Porto,Braga},{Porto,Aveiro},

>        {Lisboa,Faro},{Lisboa,Évora}},G1);

e1, e2, e3, e4, e5, e6, e7, e8, e9

>    draw(G1);

[Maple Plot]

>    K8 := complete(8); draw(K8);

K8 := proc (x) options GRAPH, `3`; if x = _Edges then procname(_Edges) := {} elif x = _EdgeIndex then procname(_EdgeIndex) := table(symmetric) elif x = _Head then procname(_Head) := table() elif x = _T...
K8 := proc (x) options GRAPH, `3`; if x = _Edges then procname(_Edges) := {} elif x = _EdgeIndex then procname(_EdgeIndex) := table(symmetric) elif x = _Head then procname(_Head) := table() elif x = _T...
K8 := proc (x) options GRAPH, `3`; if x = _Edges then procname(_Edges) := {} elif x = _EdgeIndex then procname(_EdgeIndex) := table(symmetric) elif x = _Head then procname(_Head) := table() elif x = _T...
K8 := proc (x) options GRAPH, `3`; if x = _Edges then procname(_Edges) := {} elif x = _EdgeIndex then procname(_EdgeIndex) := table(symmetric) elif x = _Head then procname(_Head) := table() elif x = _T...
K8 := proc (x) options GRAPH, `3`; if x = _Edges then procname(_Edges) := {} elif x = _EdgeIndex then procname(_EdgeIndex) := table(symmetric) elif x = _Head then procname(_Head) := table() elif x = _T...
K8 := proc (x) options GRAPH, `3`; if x = _Edges then procname(_Edges) := {} elif x = _EdgeIndex then procname(_EdgeIndex) := table(symmetric) elif x = _Head then procname(_Head) := table() elif x = _T...
K8 := proc (x) options GRAPH, `3`; if x = _Edges then procname(_Edges) := {} elif x = _EdgeIndex then procname(_EdgeIndex) := table(symmetric) elif x = _Head then procname(_Head) := table() elif x = _T...
K8 := proc (x) options GRAPH, `3`; if x = _Edges then procname(_Edges) := {} elif x = _EdgeIndex then procname(_EdgeIndex) := table(symmetric) elif x = _Head then procname(_Head) := table() elif x = _T...
K8 := proc (x) options GRAPH, `3`; if x = _Edges then procname(_Edges) := {} elif x = _EdgeIndex then procname(_EdgeIndex) := table(symmetric) elif x = _Head then procname(_Head) := table() elif x = _T...
K8 := proc (x) options GRAPH, `3`; if x = _Edges then procname(_Edges) := {} elif x = _EdgeIndex then procname(_EdgeIndex) := table(symmetric) elif x = _Head then procname(_Head) := table() elif x = _T...
K8 := proc (x) options GRAPH, `3`; if x = _Edges then procname(_Edges) := {} elif x = _EdgeIndex then procname(_EdgeIndex) := table(symmetric) elif x = _Head then procname(_Head) := table() elif x = _T...
K8 := proc (x) options GRAPH, `3`; if x = _Edges then procname(_Edges) := {} elif x = _EdgeIndex then procname(_EdgeIndex) := table(symmetric) elif x = _Head then procname(_Head) := table() elif x = _T...
K8 := proc (x) options GRAPH, `3`; if x = _Edges then procname(_Edges) := {} elif x = _EdgeIndex then procname(_EdgeIndex) := table(symmetric) elif x = _Head then procname(_Head) := table() elif x = _T...
K8 := proc (x) options GRAPH, `3`; if x = _Edges then procname(_Edges) := {} elif x = _EdgeIndex then procname(_EdgeIndex) := table(symmetric) elif x = _Head then procname(_Head) := table() elif x = _T...
K8 := proc (x) options GRAPH, `3`; if x = _Edges then procname(_Edges) := {} elif x = _EdgeIndex then procname(_EdgeIndex) := table(symmetric) elif x = _Head then procname(_Head) := table() elif x = _T...
K8 := proc (x) options GRAPH, `3`; if x = _Edges then procname(_Edges) := {} elif x = _EdgeIndex then procname(_EdgeIndex) := table(symmetric) elif x = _Head then procname(_Head) := table() elif x = _T...
K8 := proc (x) options GRAPH, `3`; if x = _Edges then procname(_Edges) := {} elif x = _EdgeIndex then procname(_EdgeIndex) := table(symmetric) elif x = _Head then procname(_Head) := table() elif x = _T...
K8 := proc (x) options GRAPH, `3`; if x = _Edges then procname(_Edges) := {} elif x = _EdgeIndex then procname(_EdgeIndex) := table(symmetric) elif x = _Head then procname(_Head) := table() elif x = _T...

[Maple Plot]

>    draw(complete(20));

[Maple Plot]