Tulip Tutorial Map manipulation

Bourqui Romain

Description

IntroductionMap OperationsExerciceTulip TutorialMap manipulation1Bourqui Romain1University Bordeaux ILaBRI, Laboratoire Bordelais de Recherche en Informatique.351 Cours de la libration Talence 33405Tulip days, 2006Bourqui Romain Tulip Tutorial Map manipulationIntroductionMap OperationsExerciceWhat’s a map ?Def. : A map is an embedding of a graph on a surface.Nb : a graph be represented by several maps.example :Bourqui Romain Tulip Tutorial Map manipulationIntroductionMap OperationsExerciceWhat’s a map ?Def. : A map is an embedding of a graph on a surface.Nb : a graph be represented by several maps.example :Bourqui Romain Tulip Tutorial Map manipulationIntroductionMap OperationsExerciceWhat’s a map ?Def. : A map is an embedding of a graph on a surface.Nb : a graph be represented by several maps.example :Bourqui Romain Tulip Tutorial Map manipulationIntroductionMap OperationsExerciceSummaryIntroductionMap OperationsConstructor and forbidden operationsIteratorsSpecific operationsOthers operationsExerciceBourqui Romain Tulip Tutorial Map manipulationConstructor and forbidden operationsIntroductionIteratorsMap OperationsSpecific operationsExerciceOthers operationsMap OperationsI Constructor and forbidden operationsI IteratorsI Specific operationsBourqui Romain Tulip Tutorial Map manipulation#includePlanarConMap *map = new PlanarConMap(graph);delete map;Constructor and forbidden ...

Sujets

• informatique
• informatique cours

Informations

• Publié par: Thioj
• Nombre de lectures: 57
• Langue: Slovak

Extrait

Introduction Map Operations Exercice

Tulip Tutorial Map manipulation

Bourqui Romain

1

1 University Bordeaux I LaBRI, Laboratoire Bordelais de Recherche en Informatique. 351 Cours de la libration Talence 33405

oBur

Tulip days, 2006

qiuoRamniTulipTutorialMapaminupalitno

What’s a map ?

Introduction Map Operations Exercice

Def. :A map is an embedding of a graph on a surface. Nb :a graph be represented by several maps. example :

BourqiuoRaminTulipuTtorialMapaminupalitno

What’s a map ?

Introduction Map Operations Exercice

Def. :A map is an embedding of a graph on a surface. Nb :a graph be represented by several maps. example :

oBruquioRmainuTlipuTtroialMapamnipulation

What’s a map ?

Introduction Map Operations Exercice

Def. :A map is an embedding of a graph on a surface. Nb :a graph be represented by several maps. example :

BourquiRomainuTilpuTtroailMapmanipulation

Summary

Introduction

Introduction Map Operations Exercice

Map Operations Constructor and forbidden operations Iterators Specific operations Others operations

Exercice

BourqiuoRamniuTilpuTtorialMapmanipulation

itnoepar arotI s et ecifi rs Spraticope rehtO sno itareposson Itnorudtcion MapOperations rexEecic snoCcurtratofondidrbnode pinampaMlairotuTipulnTaiomiRquur

Map Operations

I Constructor and forbidden operations I Iterators I Specific operations

ionulatoB

nalaonrCPPwenanal*paM=pam >.he<tuclud#inMnparaoClPnail/p talunoi

......

...... int main(){ Graph *graph = tlp::loadGraph(“planarConnexeTest.tlp”);

......

Map construction

delete graph; return EXIT SUCCESS; }

ruuqRimoiaTnlupiTutorialMapmanipBo aM(pCrno)h;rgpa delap;etem opficcipensioater tI snoita S srotare srpotOehoisnreta pOMarapeonti xe s E rtnIcudonoit andforbiddenoper crci C e notsurtcro

raoCMnpag(arhp;)nMap*map=newPlan detelep;ma iuoRuoqruTilamniBnoitalup

...... #include<tulip/PlanarConMap.h> ...... int main(){ Graph *graph = tlp::loadGraph(“planarConnexeTest.tlp”);

......

delete graph; return EXIT SUCCESS; }

Map construction

iaorutpTnimaaplM eparitnoO s htreos perationSpecifico aretsrot itar I snodeidpenondrarbfocuotsnrt ec oC reic ns Ex atioOper n Map oitcudortnI PlanarCo s

tiuc Ma onInodtr oranructonst ice C excr no E saritOpep pe s S oraterIt nsiotareponeddibrofd n

...... #include<tulip/PlanarConMap.h> ...... int main(){ Graph *graph = tlp::loadGraph(“planarConnexeTest.tlp”); PlanarConMap *map = new PlanarConMap(graph); ...... delete map; delete graph; return EXIT SUCCESS; }

Map construction

taoialMatoriipulpmanoBruipTunTulomaiquiR ficcieropioat Ot ns srehrepooitasn

ontirapesoerth s O noitarepocfiicepS torstera ons I rationepdiedofbrardn s icre oC ec rtsnotcu ap n MerOpioat Ex ns Itnorudtcoi aMmpirlauTotlupi

Forbidden operations : examples

......

......

......

ionulatanip ;)2n,1n(egdE nTaiomiRquurBo

...... Graph *graph = tlp::loadGraph(“planarConnexeTest.tlp”); PlanarConMap *map = new PlanarConMap(graph); ......

noden1,n2; egdeeg=arhpa→dd odn=genphradda→edoN;)(

n21,enod e ;n onsratisopether edonepardnofbrditructora cice Cons itar O snofiiceepoc tora Sp rs onti te s I udtcoi M nItnor ions Exer apOperat

......

...... Graph *graph = tlp::loadGraph(“planarConnexeTest.tlp”); PlanarConMap *map = new PlanarConMap(graph); ...... node n = graph→addNode(); ......

Forbidden operations : examples

......

nioatulip →aphEdddeedgra=g;)n(eg2n,1 omainTulBourquiRlaaMmpnapiuTotir