Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

fix: 복수형 표현 잘못된 것 수정 #46

Merged
merged 1 commit into from
Aug 31, 2020
Merged

fix: 복수형 표현 잘못된 것 수정 #46

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
14 changes: 7 additions & 7 deletions yoonexample/src/main/java/graph/ListGraph.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -5,30 +5,30 @@

public class ListGraph implements Graph {

private final List<Enum<?>>[] vertexes;
private final List<Enum<?>>[] vertices;

public ListGraph(int vertexCount, Class<? extends Enum<?>> clazz) {
Enum<?>[] enumConstants = clazz.getEnumConstants();
int min = Math.min(vertexCount, enumConstants.length);

this.vertexes = new List[min];
this.vertices = new List[min];
for (int i = 0; i < min; i++) {
this.vertexes[i] = new DummyDoublyLinkedList<>();
this.vertexes[i].insert(enumConstants[i]);
this.vertices[i] = new DummyDoublyLinkedList<>();
this.vertices[i].insert(enumConstants[i]);
}
}

@Override
public void addEdge(Enum<?> fromV, Enum<?> toV) {
vertexes[fromV.ordinal()].insert(toV);
vertexes[toV.ordinal()].insert(fromV);
vertices[fromV.ordinal()].insert(toV);
vertices[toV.ordinal()].insert(fromV);
}

@Override
public String showGraphEdgeInfo() {
StringBuilder sb = new StringBuilder();

for (List<Enum<?>> vertex : vertexes) {
for (List<Enum<?>> vertex : vertices) {
if (vertex.size() > 1) {
for (int i = 0; i < vertex.size(); i++) {
sb.append(vertex.get(i));
Expand Down