P.I.G.A.L.E.
1.3.9
Public Implementation of a Graph Algorithm
Library and Editor
H. de Fraysseix      P. Ossona de Mendez

---

netcut.cpp File Reference

---

Detailed Description

Embedder and Partitioner method implementation.

Include dependency graph for netcut.cpp:

Functions

• int split (Graph &G0, int &NumberOfClasses, int usedDistance)

Variables

• static char * ColorNames []
• static Locals * l

---

Function Documentation

int split	(	Graph &	G0,
		int &	NumberOfClasses,
		int	usedDistance
	)

Split a graph in a prescribed number of classes.

Parameters:

	G0	a simple graph with at least 3 vertices and 2 edges
	NumberOfClasses	the number of desired classes

Actions:

• creates a SplitGraph which derives from EmbedRnGraph which embeds the graph in
• calls SplitGraph::Segment to perform the partition
• color the vertices according to its class G.ClassNumber[v()]

Parameters:

	G0	Refrence to the topological graph to embed
	NumberOfClasses	Required number of classes

Precondition:

The graph should have at least 3 vertices and 2 edges

---

Variable Documentation

char* ColorNames[] [static]

Initial value:

 
    {"White",
    "Black",
    "Red",
    "Green",
    "Blue",
    "Yellow",
    "Violet",
    "Orange",
    "Cyan",
    "Brown",
    "Pink",
    "Green2",
    "Blue2",
    "Grey1",
    "Grey2",
    "Grey3",
    "Ivory"
    }

Locals* l [static]

local structure

---