vertex Struct Reference

#include <rawgraph.h>

Collaboration diagram for vertex:

Data Fields
pointf	pos
polygon *	poly
struct vertex *	active
int	color
int	topsort_order
adj_list_t	adj_list
	adjacency list
struct position	pos
struct polygon *	poly
struct active_edge *	active

Detailed Description

Definition at line 32 of file legal.c.

Field Documentation

active [1/2]

struct vertex* vertex::active

Definition at line 35 of file legal.c.

Referenced by find_ints(), find_ints(), and Plegal_arrangement().

active [2/2]

struct active_edge* vertex::active

Definition at line 28 of file simple.h.

adj_list

adj_list_t vertex::adj_list

Definition at line 22 of file rawgraph.h.

Referenced by dumpChanG(), edge_exists(), free_graph(), insert_edge(), LIST(), and remove_redge().

color

int vertex::color

Definition at line 20 of file rawgraph.h.

Referenced by LIST(), make_graph(), and top_sort().

poly [1/2]

polygon* vertex::poly

Definition at line 34 of file legal.c.

Referenced by find_intersection(), Plegal_arrangement(), and Plegal_arrangement().

poly [2/2]

struct polygon* vertex::poly

Definition at line 27 of file simple.h.

pos [1/2]

pointf vertex::pos

Definition at line 33 of file legal.c.

Referenced by intpoint(), intpoint(), online(), online(), Plegal_arrangement(), Plegal_arrangement(), putSeg(), realIntersect(), sgnarea(), and sgnarea().

pos [2/2]

struct position vertex::pos

Definition at line 26 of file simple.h.

topsort_order

int vertex::topsort_order

Definition at line 21 of file rawgraph.h.

Referenced by assignTrackNo(), and top_sort().

---

The documentation for this struct was generated from the following files:

• lib/neatogen/legal.c
• lib/ortho/rawgraph.h
• tclpkg/tclpathplan/simple.h