Package | Description |
---|---|
broadwick.graph |
This package contains classes for reading and manipulating graphs.
|
broadwick.graph.algorithms |
This package contains several useful algorithms for acting on graphs.
|
broadwick.graph.writer |
This package contains classes for saving graphs in various formats.
|
broadwick.phylo |
This package contains parsers for phylogenetic trees.
|
Modifier and Type | Class and Description |
---|---|
class |
DepthFirstIterator<V extends Vertex,E extends Edge<V>>
Iterator over all the vertices in a graph using a depth first traversal algorithm.
|
class |
DirectedGraph<V extends Vertex,E extends Edge<V>>
A
DirectedGraph , suitable for sparse graphs, that permits parallel edges.. |
interface |
Graph<V extends Vertex,E extends Edge<V>>
A graph consisting of a set of vertices of type
V set and a set of edges of type
E . |
class |
Tree<V extends Vertex,E extends Edge<V>>
A subtype of Graph which is a (directed, rooted) tree.
|
class |
UndirectedGraph<V extends Vertex,E extends Edge<V>>
A
DirectedGraph , suitable for sparse graphs, that permits parallel edges.. |
Modifier and Type | Class and Description |
---|---|
class |
ShortestPath<V extends Vertex,E extends Edge<V>>
Calculates distances in a specified graph, using Dijkstra's single-source-shortest-path algorithm.
|
Modifier and Type | Method and Description |
---|---|
private static void |
GraphMl.addEdge(Edge edge,
org.jdom2.Element element)
Add an edge to the graphML document.
|
Modifier and Type | Method and Description |
---|---|
void |
GraphWriter.save(String file,
Graph<? extends Vertex,? extends Edge<Vertex>> network)
Write the XML document into file.
|
static void |
GraphViz.save(String file,
Graph<? extends Vertex,? extends Edge<Vertex>> network)
Save the graph as in graphviz format in the given file.
|
static void |
GraphMl.save(String file,
Graph<? extends Vertex,? extends Edge<Vertex>> network)
Save the graph as in graphML format in the given file.
|
static void |
EdgeList.save(String file,
Graph<? extends Vertex,? extends Edge<Vertex>> network)
Save the graph as in edge list format in the given file.
|
String |
GraphWriter.toString(Graph<? extends Vertex,? extends Edge<?>> network)
Print the content of the graph.
|
static String |
GraphViz.toString(Graph<? extends Vertex,? extends Edge<?>> network)
Print the content of the graph.
|
static String |
GraphMl.toString(Graph<? extends Vertex,? extends Edge<?>> network)
Get the string representation of the network.
|
static String |
EdgeList.toString(Graph<? extends Vertex,? extends Edge<?>> network)
Print the content of the graph.
|
static String |
GraphMl.toString(Graph<? extends Vertex,? extends Edge<?>> network,
boolean directed)
Get the string representation of the network.
|
Modifier and Type | Method and Description |
---|---|
Tree<PhyloNode,Edge<PhyloNode>> |
NewickTreeParser.parse()
Parse a string from a Newick file.
|
Tree<PhyloNode,Edge<PhyloNode>> |
NewickTreeParser.parse(String newickStr)
Parse a given string that MUST be a valid Newick format.
|
Modifier and Type | Method and Description |
---|---|
private PhyloNode |
NewickTreeParser.addNodeToTree(String node,
Tree<PhyloNode,Edge<PhyloNode>> tree,
PhyloNode parent,
boolean createUniqueName)
Given a string that represents a node in the tree, split in into its constituent name and distance components and
add it to the tree.
|
private void |
NewickTreeParser.parseNode(String node,
Tree<PhyloNode,Edge<PhyloNode>> tree,
PhyloNode parent)
Parse a string containing information on a node in Newick format and attach it to a given tree.
|
private void |
NewickTreeParser.parseString(String stringToParse,
PhyloNode parent,
Tree<PhyloNode,Edge<PhyloNode>> tree)
Parse a string in Newick format (where the root node has been removed) recursively.
|
Copyright © 2015 University of Glasgow. All rights reserved.