org.jgrapht.graph

Class MixedGraphUnion<V,E>

• Constructor Detail

• MixedGraphUnion

public MixedGraphUnion(UndirectedGraph<V,E> g1,
DirectedGraph<V,E> g2,
WeightCombiner operator)
Deprecated.
Construct a new graph union.
Parameters:
g1 - the undirected graph
g2 - the directed graph
operator - the weight combiner (policy for edge weight calculation)
• MixedGraphUnion

public MixedGraphUnion(UndirectedGraph<V,E> g1,
DirectedGraph<V,E> g2)
Deprecated.
Construct a new graph union. The union will use the WeightCombiner.SUM weight combiner.
Parameters:
g1 - the undirected graph
g2 - the directed graph
• Method Detail

• inDegreeOf

public int inDegreeOf(V vertex)
Deprecated.
Description copied from interface: Graph
Returns the "in degree" of the specified vertex.

The "in degree" of a vertex in a directed graph is the number of inward directed edges from that vertex. See http://mathworld.wolfram.com/Indegree.html.

In the case of undirected graphs this method returns the number of edges touching the vertex. Edges with same source and target vertices (self-loops) are counted twice.

Specified by:
inDegreeOf in interface Graph<V,E>
Overrides:
inDegreeOf in class GraphUnion<V,E,Graph<V,E>>
Parameters:
vertex - vertex whose degree is to be calculated.
Returns:
the degree of the specified vertex.
• incomingEdgesOf

public Set<E> incomingEdgesOf(V vertex)
Deprecated.
Description copied from interface: Graph
Returns a set of all edges incoming into the specified vertex.

In the case of undirected graphs this method returns all edges touching the vertex, thus, some of the returned edges may have their source and target vertices in the opposite order.

Specified by:
incomingEdgesOf in interface Graph<V,E>
Overrides:
incomingEdgesOf in class GraphUnion<V,E,Graph<V,E>>
Parameters:
vertex - the vertex for which the list of incoming edges to be returned.
Returns:
a set of all edges incoming into the specified vertex.
• outDegreeOf

public int outDegreeOf(V vertex)
Deprecated.
Description copied from interface: Graph
Returns the "out degree" of the specified vertex.

The "out degree" of a vertex in a directed graph is the number of outward directed edges from that vertex. See http://mathworld.wolfram.com/Outdegree.html.

In the case of undirected graphs this method returns the number of edges touching the vertex. Edges with same source and target vertices (self-loops) are counted twice.

Specified by:
outDegreeOf in interface Graph<V,E>
Overrides:
outDegreeOf in class GraphUnion<V,E,Graph<V,E>>
Parameters:
vertex - vertex whose degree is to be calculated.
Returns:
the degree of the specified vertex.
• outgoingEdgesOf

public Set<E> outgoingEdgesOf(V vertex)
Deprecated.
Description copied from interface: Graph
Returns a set of all edges outgoing from the specified vertex.

In the case of undirected graphs this method returns all edges touching the vertex, thus, some of the returned edges may have their source and target vertices in the opposite order.

Specified by:
outgoingEdgesOf in interface Graph<V,E>
Overrides:
outgoingEdgesOf in class GraphUnion<V,E,Graph<V,E>>
Parameters:
vertex - the vertex for which the list of outgoing edges to be returned.
Returns:
a set of all edges outgoing from the specified vertex.
• degreeOf

public int degreeOf(V vertex)
Deprecated.
Description copied from interface: Graph
Returns the degree of the specified vertex.

A degree of a vertex in an undirected graph is the number of edges touching that vertex. Edges with same source and target vertices (self-loops) are counted twice.

In directed graphs this method returns the sum of the "in degree" and the "out degree".

Specified by:
degreeOf in interface Graph<V,E>
Overrides:
degreeOf in class GraphUnion<V,E,Graph<V,E>>
Parameters:
vertex - vertex whose degree is to be calculated.
Returns:
the degree of the specified vertex.