Graph problem

[mic ta]

Hello,
I found an implement a graph product http://www.math.ucsd.edu/~fan/graphdraw/llu/graphproduct/Graph.java, but unfortunately I do not how can I combine this with the following code:

//Vertex.java------------------------------------------------------
class Vertex {
	int no;
	float x,y,z;

	public Vertex(int no, float x, float y, float z)
	{
		this.no = no;
		this.x = x;
		this.y = y;
		this.z = z;
	}

	public String toString()
	{
		return "("+no+", "+x+","+y+","+z+")";
	}
}

    
//Edge.java---------------------------------------------------------- 
class Edge  
{ 
	float length;  
	Vertex v0, v1; 

	public Edge(Vertex v0, Vertex v1) { 
		this.v0 = v0; 
		this.v1 = v1; 
		this.length = computeLength(); //Abstand von v0 zu v1 
	} 
	
	private float computeLength()  
	{ 
		float dx = v0.x - v1.x; 
		float dy = v0.y - v1.y; 
		float dz = v0.z - v1.z; 
		return (float) Math.sqrt(dx*dx+dy*dy+dz*dz); 
	} 
	float getLength()  
	{ 
		return length; 
	} 
}

//BronKerbosh01.java--------------------------------------------- 
import java.io.File; 
import java.io.IOException; 
import java.util.ArrayList; 
import java.util.Collection; 
import java.util.Scanner; 
import java.util.Set; 
import org.jgrapht.EdgeFactory; 
import org.jgrapht.WeightedGraph; 
import org.jgrapht.alg.BronKerboschCliqueFinder; 
import org.jgrapht.graph.SimpleWeightedGraph; 

public class BronKerbosh01 { 
	static void creatVertex(String fileName, ArrayList<Vertex> vertexList) throws IOException{ 
		Scanner diskScanner = new Scanner(new File(fileName)); 
		while (diskScanner.hasNext()) { 
			Vertex vertex = new Vertex(diskScanner.nextInt(), diskScanner.nextFloat(), diskScanner.nextFloat(), diskScanner.nextFloat()); 
			vertexList.add(vertex); 
		} 
	}  

	static void creatEdges(ArrayList<Vertex> vertexList, ArrayList<Edge> edgesList){ 
		for (int i = 0; i < vertexList.size(); i++){ 
			if (i == vertexList.size()-1) break; 
			else { 
				Edge edge = new Edge(vertexList.get(i), vertexList.get(i+1)); 
				edgesList.add(edge); 
			} 
		} 
	} 

	public static void main(String[] args) throws IOException { 
		String file1 = "ctar.txt"; 
	
		EdgeFactory<Vertex,Edge> ef = new EdgeFactory<Vertex,Edge>() 
		{ 
		public Edge createEdge(Vertex sourceVertex, Vertex targetVertex) 
		{ 
			return new Edge(sourceVertex, targetVertex); 
		} 
		}; 
	
		WeightedGraph<Vertex, Edge> g = new SimpleWeightedGraph<Vertex,Edge>(ef){ 
			@Override 
		public double getEdgeWeight(Edge e) 
			{ 
				return e.getLength(); 
			} 
		}; 
	
		ArrayList<Vertex> vertexes1 = new ArrayList<Vertex>(); 
		creatVertex(file1, vertexes1); 
		for (int i = 0; i < vertexes1.size(); i++){ 
			System.out.println(vertexes1.get(i).no + " " + vertexes1.get(i).x + " " +  
					vertexes1.get(i).y + " " + vertexes1.get(i).z); 
		} 
	
		ArrayList<Edge> edges1 = new ArrayList<Edge>(); 
		creatEdges(vertexes1, edges1); 
		System.out.println(edges1.size());  
		for (int i = 0; i < edges1.size(); i++){ 
			System.out.println(edges1.get(i).length); 
		} 
	
		// Add all vertexes 
		for (int i = 0; i < vertexes1.size(); i++){ 
			g.addVertex(vertexes1.get(i)); 
		} 
	
		// Add all edges 
		for (int i = 0; i < vertexes1.size(); i++){ 
			for (int j = 0; j < vertexes1.size(); j++){ 
				if (i != j) g.addEdge(vertexes1.get(i), vertexes1.get(j)); 
			} 
		} 
	
		BronKerboschCliqueFinder<Vertex, Edge> cf = new BronKerboschCliqueFinder<Vertex, Edge>(g); 
		Collection<Set<Vertex>> cliques = cf.getAllMaximalCliques();  
		for (Set<Vertex> clique : cliques) 
		{ 
			System.out.println("Clique: "+ clique); 
		} 
	}  
}

I create the graph from the file:
22 18.378 59.466 13.185
24 14.270 54.556 18.227
26 30.119 51.333 33.732
29 26.326 51.100 21.154
33 23.764 55.050 18.338
34 17.697 75.884 26.178
36 22.351 66.269 28.727
37 19.980 63.046 33.535


How can I implement an product graph for two 3D graphs?

Thank you in advance.




Best regards,

[Campbell Ritchie]

Welcome to JavaRanch

What have you tried? We expect you to show what you have done so far.