| Package | Description |
|---|---|
| me.jaimegarza.syntax.graph | |
| me.jaimegarza.syntax.model.graph |
| Modifier and Type | Class and Description |
|---|---|
class |
DijkstraShortestPath<T extends Node>
Implementation of the Dijkstra Shortest Path algorithm with the
addition that it computes distances for all source nodes.
|
class |
KamadaKawai<T extends Node>
KamadaKawai algorithm for laying up a graph.
|
| Modifier and Type | Method and Description |
|---|---|
Node[][] |
DijkstraShortestPath.getPred() |
| Modifier and Type | Method and Description |
|---|---|
void |
SvgCanvas.node(Node n)
Produce the graph for a node
|
| Modifier and Type | Method and Description |
|---|---|
String |
SvgRenderer.render(DirectedGraph<? extends Node> graph,
int width,
int height)
Draw a dfa to SVG
|
| Modifier and Type | Class and Description |
|---|---|
class |
DirectedGraph<T extends Node>
Abstract class defining a graph with directed transitions
|
| Modifier and Type | Class and Description |
|---|---|
class |
DfaNode
A node for a dfa
|
class |
NfaNode
A node for a dfa
|
| Modifier and Type | Field and Description |
|---|---|
protected DirectedGraph<? extends Node> |
Node.graph |
| Modifier and Type | Method and Description |
|---|---|
Node |
Construct.getEnd() |
Node |
Transition.getFrom() |
Node |
Construct.getStart() |
Node |
Transition.getTo() |
| Modifier and Type | Method and Description |
|---|---|
DirectedGraph<? extends Node> |
Node.getGraph() |
| Constructor and Description |
|---|
Construct(Node start,
Node end) |
Transition(Node from,
Node to,
RegexSymbol symbol)
The default constructor.
|
| Constructor and Description |
|---|
Node(DirectedGraph<? extends Node> graph,
int id)
Default constructor
|
Copyright © 2017. All rights reserved.