agl2
Interface GraphTag

All Known Subinterfaces:

BidirectedGraph, DirectedGraph, PropertyGraph, UndirectedGraph

All Known Implementing Classes:

AbstractGraph, Bigraph, Digraph, GraphBuilder, GraphProperties, GraphTag.MapTag, GraphTag.Tag, UndirectedGraphImpl, Ungraph

public interface GraphTag

The GraphTag description.

Nested Class Summary

static class	GraphTag.MapTag
static class	GraphTag.Tag In order to make tags unique, we need to force them to through a factory method.

Field Summary

static java.util.HashMap	allTags
static GraphTag	BIGRAPH The grpah is Bidirected (in/out) :Boolean
static GraphTag	DIGRAPH The graph is Directed : Boolean
static GraphTag	EDGE_DATA edge name : map
static GraphTag	EDGE_INDEX edge weight : map
static GraphTag	EDGE_WEIGHT edge weight : map
static GraphTag	GRAPH_ACYLIC The graph is acyclic : Boolean
static GraphTag	GRAPH_NAME The graphs name : String
static GraphTag	GRAPH_ROOT The graphs root : Object
static GraphTag	GRAPH_TRAITS Global map for graph traits
static GraphTag	MULTIGRAPH The graph is a multigraph : Boolean
static GraphTag	OBJECT_VERTEX Objects may be used as vertices : Boolean
static GraphTag	UNGRAPH The graph is Undirected : Boolean
static GraphTag	VERTEX_COLOR Vertex Color : map (used by BFS, DFS)
static GraphTag	VERTEX_DATA vertex data : map
static GraphTag	VERTEX_DISTANCE Vertex distance : map
static GraphTag	VERTEX_EDGEMAP Vertex EdgeMap : map> For each vertex provide a map from EdgeData->Vertex.
static GraphTag	VERTEX_INDEX Vertex Index : map

Field Detail

allTags

public static final java.util.HashMap allTags

GRAPH_TRAITS

public static final GraphTag GRAPH_TRAITS

Global map for graph traits

UNGRAPH

public static final GraphTag UNGRAPH

The graph is Undirected : Boolean

DIGRAPH

public static final GraphTag DIGRAPH

The graph is Directed : Boolean

BIGRAPH

public static final GraphTag BIGRAPH

The grpah is Bidirected (in/out) :Boolean

MULTIGRAPH

public static final GraphTag MULTIGRAPH

The graph is a multigraph : Boolean

GRAPH_ACYLIC

public static final GraphTag GRAPH_ACYLIC

The graph is acyclic : Boolean

GRAPH_NAME

public static final GraphTag GRAPH_NAME

The graphs name : String

OBJECT_VERTEX

public static final GraphTag OBJECT_VERTEX

Objects may be used as vertices : Boolean

GRAPH_ROOT

public static final GraphTag GRAPH_ROOT

The graphs root : Object

EDGE_WEIGHT

public static final GraphTag EDGE_WEIGHT

edge weight : map

EDGE_DATA

public static final GraphTag EDGE_DATA

edge name : map

EDGE_INDEX

public static final GraphTag EDGE_INDEX

edge weight : map

VERTEX_DATA

public static final GraphTag VERTEX_DATA

vertex data : map

VERTEX_DISTANCE

public static final GraphTag VERTEX_DISTANCE

Vertex distance : map

VERTEX_INDEX

public static final GraphTag VERTEX_INDEX

Vertex Index : map

VERTEX_COLOR

public static final GraphTag VERTEX_COLOR

Vertex Color : map (used by BFS, DFS)

VERTEX_EDGEMAP

public static final GraphTag VERTEX_EDGEMAP

Vertex EdgeMap : map> For each vertex provide a map from EdgeData->Vertex.