/
NodeAdjacencies.java
55 lines (46 loc) · 1.43 KB
/
NodeAdjacencies.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
/*
* Copyright (C) 2016 The Guava Authors
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package com.google.common.graph;
import java.util.Set;
/**
* An interface for representing an origin node's adjacent nodes in a graph.
*
* @author James Sexton
* @param <N> Node parameter type
*/
interface NodeAdjacencies<N> {
Set<N> adjacentNodes();
Set<N> predecessors();
Set<N> successors();
/**
* Remove {@code node} from the set of predecessors.
*/
void removePredecessor(Object node);
/**
* Remove {@code node} from the set of successors.
*/
void removeSuccessor(Object node);
/**
* Add {@code node} as a predecessor to the origin node.
* In the case of an undirected graph, it also becomes a successor.
*/
void addPredecessor(N node);
/**
* Add {@code node} as a successor to the origin node.
* In the case of an undirected graph, it also becomes a predecessor.
*/
void addSuccessor(N node);
}