Package | Description |
---|---|
de.uni_due.inf.ti.graph | |
de.uni_due.inf.ti.graph.io | |
de.uni_due.inf.ti.graph.random |
This package contains classes which generate random graphs, rules and
other graph-related objects.
|
de.uni_due.inf.ti.graph.util |
Utility classes.
|
de.uni_due.inf.ti.graph.visual |
The classes of this package provide an interface between the Hypergraph
Library and the VisiGraph graph visualization library.
|
Modifier and Type | Class and Description |
---|---|
class |
InterfaceGraph
This class represents a hypergraph with an inner and an outer interface.
|
Modifier and Type | Method and Description |
---|---|
static Graph |
GraphFactory.createCompleteGraph(int numOfNodes,
Label label)
Creates a new complete graph.
|
static Graph |
GraphFactory.createCompleteGraph(int numOfNodes,
Label label,
boolean loops)
Creates a new complete graph.
|
static Graph |
GraphFactory.createCycleGraph(int numOfNodes,
Label label)
Creates a new cycle graph.
|
static Graph |
GraphFactory.createDiscreteGraph(int numOfNodes)
Creates a new discrete graph.
|
static Graph |
GraphFactory.createFlowerGraph(java.util.Collection<Label> signature)
Creates a flower graph of a given signature.
|
static Graph |
GraphFactory.createPathGraph(int numOfNodes,
Label label)
Creates a new path graph.
|
static Graph |
GraphFactory.createRandomGraphWithPathWidth(int numOfNodes,
double density,
int pathWidth,
java.util.Set<Label> sig)
Creates a new random graph of which the path width will not exceed
a given bound.
|
Graph |
Morphism.getCodomain()
Returns the codomain of this morphism.
|
Graph |
Morphism.getDomain()
Returns the domain of this morphism.
|
Graph |
GraphElement.getGraph()
Returns the graph to which this GraphElement belongs.
|
Graph |
TransformationSystem.getInitialGraph()
Returns the initial graph of this transformation system.
|
Graph |
TransitionSystem.getInitialGraph()
Returns the initial graph of this graph transition system.
|
Graph |
ExplicitTransitionSystem.getInitialGraph()
Returns the initial graph of this graph transition system.
|
Graph |
Trace.getInitialGraph()
Returns the first graph of the trace.
|
Graph |
Rule.getLeft()
Returns the left-hand side of this rule.
|
Graph |
Rule.getRight()
Returns the right-hand side of this rule.
|
Graph |
Transition.getSource()
Returns the source graph of this transition.
|
Graph |
Transition.getTarget()
Returns the target graph of this transition.
|
Modifier and Type | Method and Description |
---|---|
java.util.Set<Graph> |
ExplicitTransitionSystem.getGraphs()
Returns the set of graphs which occur in this transition system.
|
java.util.List<Graph> |
Trace.getGraphs()
Returns the list of graphs of this trace.
|
Modifier and Type | Method and Description |
---|---|
Morphism |
InterfaceGraph.Interface.asMorphism(Graph domain)
Returns this interface as a morphism from a given domain to the
graph of which this is an interface.
|
static TransformationSystem |
TransformationSystem.create(Graph initial,
java.util.Collection<Rule> rules)
Creates a new transformation system.
|
static ExplicitTransitionSystem |
ExplicitTransitionSystem.create(Graph initial,
java.util.Collection<Transition> transitions)
Creates a new ExplicitTransitionSystem.
|
static Morphism |
Morphism.create(Graph domain,
Graph codomain)
Creates a new, empty morphism with given domain and codomain.
|
static Morphism |
Morphism.create(Graph domain,
Graph codomain,
java.util.Map<Node,Node> nodeMap)
Creates a new morphism which only maps nodes.
|
static Morphism |
Morphism.create(Graph domain,
Graph codomain,
java.util.Map<Node,Node> nodeMap,
java.util.Map<Edge,Edge> edgeMap)
Creates a new morphism from a node map and an edge map.
|
static ExplicitTransitionSystem |
ExplicitTransitionSystem.create(Graph initial,
Morphism... transitions)
Creates a new ExplicitTransitionSystem.
|
static TransformationSystem |
TransformationSystem.create(Graph initial,
Rule... rules)
Creates a new transformation system.
|
static Morphism |
Morphism.createIdentity(Graph graph)
Creates a new identity morphism.
|
static Morphism |
Morphism.createIsomorphism(Graph graph)
Creates a new graph which is isomorphic to a given graph and returns
an isomorphism between that graph and the new one.
|
static ExplicitTransitionSystem |
ExplicitTransitionSystem.createWithMorphisms(Graph initial,
java.util.Collection<Morphism> morphisms)
Creates a new ExplicitTransitionSystem by giving a collection of
transition morphisms.
|
static Morphism |
Morphism.getInjectiveMatch(Graph domain,
Graph codomain)
Returns an injective, total morphism from a given domain to a given
codomain which is an extension of a given morphism.
|
static Morphism |
Morphism.getInjectiveMatch(Graph domain,
Graph codomain,
Morphism base)
Returns an injective morphism from a given domain to a given codomain.
|
static Morphism.MorphismCollection |
Morphism.getInjectiveMatches(Graph domain,
Graph codomain)
Returns a collection of all injective morphisms from one graph to
another.
|
static Morphism.MorphismCollection |
Morphism.getInjectiveMatches(Graph domain,
Graph codomain,
Morphism base)
Returns a collection of all injective, total morphisms from one graph
to another, which are an extension of a given (partial) morphism.
|
static Morphism |
Morphism.getIsomorphism(Graph domain,
Graph codomain)
Returns an isomorphism from a given domain to a given codomain graph.
|
static Morphism |
Morphism.getIsomorphism(Graph domain,
Graph codomain,
Morphism base)
Returns an isomorphism from a given domain to a given codomain graph
which is an extension of a given morphism.
|
static Morphism.MorphismCollection |
Morphism.getIsomorphisms(Graph domain,
Graph codomain)
Returns a collection of all isomorphism between two graphs.
|
static Morphism.MorphismCollection |
Morphism.getIsomorphisms(Graph domain,
Graph codomain,
Morphism base)
Returns a collection of all isomorphisms between two graphs which are
extension of a given injective morphism.
|
static Morphism |
Morphism.getMatch(Graph domain,
Graph codomain)
Returns a total morphism from a given domain to a given codomain.
|
static Morphism |
Morphism.getMatch(Graph domain,
Graph codomain,
boolean injective)
Returns a morphism from a given domain to a given codomain.
|
static Morphism |
Morphism.getMatch(Graph domain,
Graph codomain,
boolean injective,
Morphism base)
Returns a morphism from a given domain to a given codomain which is
an extension of a given base morphism.
|
static Morphism |
Morphism.getMatch(Graph domain,
Graph codomain,
Morphism base)
Returns a total morphism from a given domain to a given codomain which
is an extension of a given morphism.
|
java.util.Collection<Morphism> |
Rule.getMatches(Graph graph)
Returns a collection of matches of this rule to a given graph.
|
static Morphism.MorphismCollection |
Morphism.getMatches(Graph domain,
Graph codomain)
Returns a collection of all total morphisms from one graph to another.
|
static Morphism.MorphismCollection |
Morphism.getMatches(Graph domain,
Graph codomain,
boolean injective)
Returns a collection of all total morphisms from one graph to another.
|
static Morphism.MorphismCollection |
Morphism.getMatches(Graph domain,
Graph codomain,
boolean injective,
Morphism base)
Returns a collection of all the total morphisms from one graph to
another which are extensions of a given (partial) morphism.
|
static Morphism.MorphismCollection |
Morphism.getMatches(Graph domain,
Graph codomain,
Morphism base)
Returns a collection of all the total morphisms from one graph to
another which are extensions of a given (partial) morphism.
|
static Morphism.MorphismCollection |
Morphism.getPartialMorphisms(Graph domain,
Graph codomain,
boolean injective,
Morphism base)
Returns a MorphismCollection of partial morphisms from a domain to a
codomain which are extensions of a given base morphism.
|
static Morphism.MorphismCollection |
Morphism.getPartialMorphisms(Graph domain,
Graph codomain,
Morphism base)
Returns a MorphismCollection of partial morphisms from a domain to a
codomain which are extension of a given base morphism.
|
java.util.Collection<Transition> |
TransformationSystem.getTransitions(Graph source)
Returns the outgoing transitions from a source graph.
|
java.util.Collection<Transition> |
TransitionSystem.getTransitions(Graph source)
Returns the outgoing transitions from a source graph.
|
java.util.Set<Transition> |
ExplicitTransitionSystem.getTransitions(Graph source)
Returns the outgoing transitions from a source graph.
|
java.util.Collection<Transition> |
Trace.getTransitions(Graph source)
Returns all transitions of this trace that begin at a specific
source graph.
|
java.util.Collection<Transition> |
TransformationSystem.getTransitions(Graph source,
int limit)
Returns the transitions of this transformation system from a certain
source graph, with a limit on how many transitions will be returned.
|
boolean |
Graph.isIsomorphic(Graph other)
Determines if this graph is isomorphic to another graph.
|
void |
TransformationSystem.setInitialGraph(Graph initial)
Sets the initial graph of this graph transformation system.
|
void |
ExplicitTransitionSystem.setInitialGraph(Graph initial)
Sets the initial graph.
|
PathDecomposition.TestData |
PathDecomposition.testGraph(Graph graph)
Tests whether this PathDecomposition is a legal path decomposition
for a given graph.
|
Constructor and Description |
---|
ExplicitTransitionSystem(Graph initial)
Creates a new ExplicitTransitionSystem with a given initial graph and
no transitions.
|
Graph(Graph orig)
Creates a new graph which is a copy of another graph.
|
GraphElement(Graph graph)
Creates a new GraphElement.
|
InterfaceGraph(Graph orig)
Creates a new InterfaceGraph which is a copy of another InterfaceGraph
or Graph.
|
Morphism(Graph domain,
Graph codomain)
Creates a new empty Morphism.
|
Modifier and Type | Method and Description |
---|---|
static Graph |
SgfParser.parseGraph(java.io.Reader in)
Parses a graph definition from an input stream.
|
Modifier and Type | Method and Description |
---|---|
void |
GraphExporter.exportGraph(Graph graph,
java.io.File file)
Exports a graph.
|
protected abstract void |
GraphExporter.exportGraphToStream(Graph graph,
java.io.OutputStream binOut)
Writes a visual representation of a graph to a binary stream.
|
protected void |
PngExporter.exportGraphToStream(Graph graph,
java.io.OutputStream binOut)
Writes a visual representation of a graph to a binary stream.
|
protected void |
DotExporter.exportGraphToStream(Graph graph,
java.io.OutputStream binOut)
Writes a visual representation of a graph to a binary stream.
|
void |
DotExporter.printDot(Graph graph,
java.io.PrintWriter out)
Prints a DOT representation of a graph to a PrintWriter.
|
void |
DotExporter.printDot(Graph graph,
java.io.PrintWriter out,
java.util.Map<java.lang.Object,DotStyle> styles)
Prints a DOT representation of this graph to a PrintWriter.
|
java.lang.String |
SgfWriter.writeGraph(Graph graph)
Writes a graph to this SgfWriter's stream.
|
Modifier and Type | Method and Description |
---|---|
Graph |
RandomGraphGenerator.fillGraph(Graph graph)
Randomly completes a graph to a number of nodes and density.
|
Graph |
RandomGraphGenerator.nextGraph()
Returns a new, random graph.
|
Modifier and Type | Method and Description |
---|---|
Graph |
RandomGraphGenerator.fillGraph(Graph graph)
Randomly completes a graph to a number of nodes and density.
|
Modifier and Type | Method and Description |
---|---|
java.util.Set<java.util.Map.Entry<Graph,T>> |
IsomorphismHashMap.entrySet() |
java.util.Iterator<Graph> |
IsomorphismHashSet.iterator()
Returns an iterator which iterates over the elements of this
IsomorphismSet.
|
Modifier and Type | Method and Description |
---|---|
boolean |
IsomorphismHashSet.add(Graph graph)
Adds a graph to this IsomorphismSet.
|
Morphism |
IsomorphismHashSet.addIsomorphic(Graph graph)
Makes sure that a graph isomorphic to a given graph is present in this
IsomorphismSet.
|
Morphism |
IsomorphismSet.addIsomorphic(Graph graph)
Makes sure that a graph isomorphic to a given graph is present in this
IsomorphismSet (optional operation).
|
Morphism |
IsomorphismHashSet.containsIsomorphic(Graph graph)
Determines whether this IsomorphismSet contains a graph which is
isomorphic to a given graph.
|
Morphism |
IsomorphismSet.containsIsomorphic(Graph graph)
Determines whether this IsomorphismSet contains a graph which is
isomorphic to a given graph.
|
T |
IsomorphismHashMap.put(Graph key,
T value) |
Modifier and Type | Method and Description |
---|---|
boolean |
IsomorphismHashSet.addAll(java.util.Collection<? extends Graph> col)
Adds all graphs in a collection to this IsoMorphismSet.
|
void |
IsomorphismHashMap.putAll(java.util.Map<? extends Graph,? extends T> map) |
Modifier and Type | Method and Description |
---|---|
de.uni_due.inf.ti.visigraph.VxGraph |
GraphVisualizer.visualizeGraph(Graph graph)
Creates a VxGraph which visualizes a graph.
|