Package | Description |
---|---|
org.thegalactic.dgraph |
This package is designed to represent directed graph.
|
org.thegalactic.dgraph.io |
This package is designed to deal with io operations for the org.thegalactic.dgraph package.
|
org.thegalactic.lattice |
This package is designed to represent lattice.
|
org.thegalactic.rule |
This package is designed to represent rules.
|
Modifier and Type | Class and Description |
---|---|
class |
DAGraph<N,E>
This class extends the representation of a directed graph given by class
ConcreteDGraph for directed acyclic graph (DAG). |
Modifier and Type | Method and Description |
---|---|
ConcreteDGraph<N,E> |
ConcreteDGraph.clone()
Returns a clone of this component composed of a clone of each node and each edge.
|
ConcreteDGraph<N,E> |
ConcreteDGraph.getSubgraphByEdges(Set<Edge<N,E>> edges)
Returns the subgraph of this component induced by the specified set of edges.
|
ConcreteDGraph<N,E> |
ConcreteDGraph.getSubgraphByNodes(Set<Node<N>> nodes)
Returns the subgraph of this component induced by the specified set of nodes.
|
ConcreteDGraph |
DGraphFactory.random(int size)
Generates a random directed graph of size nodes.
|
ConcreteDGraph<Integer,?> |
DGraphFactory.random(int size,
double threshold)
Generates a random directed graph of size nodes.
|
protected ConcreteDGraph<N,E> |
ConcreteDGraph.setNodes(TreeSet<Node<N>> nodes)
Set the set of nodes of this component.
|
protected ConcreteDGraph<N,E> |
ConcreteDGraph.setPredecessors(TreeMap<Node<N>,TreeSet<Edge<N,E>>> predecessors)
Set the predecessors of this component.
|
protected ConcreteDGraph<N,E> |
ConcreteDGraph.setSuccessors(TreeMap<Node<N>,TreeSet<Edge<N,E>>> successors)
Set the successors of this component.
|
Constructor and Description |
---|
DAGraph(ConcreteDGraph<N,E> graph)
Constructs this component as a copy of the specified directed graph.
|
Modifier and Type | Method and Description |
---|---|
void |
DGraphSerializerDot.write(ConcreteDGraph<N,E> graph,
BufferedWriter file)
Write a graph to a output stream.
|
Modifier and Type | Class and Description |
---|---|
class |
ArrowRelation
The ArrowRelation class encodes arrow relation between meet & join-irreductibles of a lattice.
|
class |
ConceptLattice
This class extends class
Lattice to provide specific methods to manipulate both a concept lattice or a closed set lattice. |
class |
Lattice<N,E>
This class extends class
DAGraph to provide specific methods to manipulate a lattice. |
Modifier and Type | Method and Description |
---|---|
ConcreteDGraph |
BijectiveComponents.getDependencyGraph()
Returns the dependency graph of this component.
|
ConcreteDGraph |
Lattice.getDependencyGraph()
Returns the dependency graph of this component.
|
ConcreteDGraph<Comparable,?> |
ClosureSystem.precedenceGraph()
Returns the precedence graph of this component.
|
Modifier and Type | Method and Description |
---|---|
protected BijectiveComponents |
BijectiveComponents.setDependencyGraph(ConcreteDGraph dependencyGraph)
Set the dependency graph of this component.
|
protected Lattice |
Lattice.setDependencyGraph(ConcreteDGraph graph)
Set the dependency graph.
|
Modifier and Type | Method and Description |
---|---|
ConcreteDGraph |
ImplicationalSystem.dependencyGraph()
Returns the dependency graph of this component.
|
ConcreteDGraph |
ImplicationalSystem.representativeGraph()
Returns the representative graph of this component.
|
Copyright © 2010–2016 The Galactic Organization. All rights reserved.