private void button1_Click(object sender, EventArgs e)
{
InitialisationFichierTexte("graphe1.txt");
//numinitial = Convert.ToInt32(textBoxNoeudInitial.Text);
//numfinal = Convert.ToInt32(textBox2.Text);
numinitial = 0;
numfinal = 6;
Noeud Ninit = new Noeud(numinitial);
Noeud NF = new Noeud(numfinal);
ArbreRecherche so = new ArbreRecherche(matrice);
List <Noeud> solution = so.Dijkstra(Ninit, NF);
RemplirTexteArbre(false);
RemplirTexteArbre(false);
RemplirTexteArbre(true);
if (reponseArbreVisible != reponseArbreNonVisible)
{
arbreEquivalent = false;
}
FormFinDijkstra correctionDijkstra = new FormFinDijkstra(ListeDesOuverts, ListeDesFermes, this.listeRepNoeudsOuverts, this.listeRepNoeudsFermes, so, arbreEquivalent);
correctionDijkstra.Show();
this.Hide();
}
public FormDijkstra()
{
InitializeComponent();
this.FormBorderStyle = FormBorderStyle.FixedSingle;
listBoxRepFermes.Enabled = false;
listBoxRepOuverts.Enabled = false;
reponses = new List <String> [2];
reponses[0] = new List <string>();
reponses[1] = new List <string>();
InitialisationFichierTexte("graphe1.txt");
Noeud Ninit = new Noeud(numinitial);
Noeud NF = new Noeud(numfinal);
ArbreRecherche sol = new ArbreRecherche(matrice);
List <Noeud> solution = sol.Dijkstra(Ninit, NF);
ListeDesOuverts = sol.ListeDesOuverts;
ListeDesFermes = sol.ListeDesFermes;
sol.GetArbreRecherche(this.treeViewExercice, true);
sol.GetArbreRecherche(this.treeViewNonVisible, false);
this.treeViewExercice.ExpandAll();
}
public FormFinDijkstra(List <List <Noeud> > listeNoeudsOuverts, List <List <Noeud> > listeNoeudsFermes, List <string> lOuverts, List <string> lFermes, ArbreRecherche a, bool arbreEquivalent)
{
InitializeComponent();
a.GetArbreRecherche(this.treeViewFinal, false);
treeViewFinal.ExpandAll();
//MessageBox.Show(reponseArbreVisible);
if (arbreEquivalent)
{
this.labelReponse.Text = "Bonne réponse !";
this.labelReponse.ForeColor = Color.Green;
}
else
{
this.labelReponse.Text = "Mauvaise réponse !";
this.labelReponse.ForeColor = Color.Red;
}
foreach (List <Noeud> listeNoeuds in listeNoeudsOuverts)
{
string str = "{";
int cpt = 0;
foreach (Noeud noeud in listeNoeuds)
{
if (cpt != listeNoeuds.Count - 1)
{
str = str + noeud.ToString() + ",";
}
else
{
str = str + noeud.ToString() + "}";
}
cpt++;
}
this.lbOuvertsFinaux.Items.Add(str);
}
foreach (List <Noeud> listeNoeuds in listeNoeudsFermes)
{
string str = "{";
int cpt = 0;
foreach (Noeud noeud in listeNoeuds)
{
if (cpt != listeNoeuds.Count - 1)
{
str = str + noeud.ToString() + ",";
}
else
{
str = str + noeud.ToString() + "}";
}
cpt++;
}
this.lbFermesFinaux.Items.Add(str);
}
this.FormBorderStyle = FormBorderStyle.FixedSingle;
lbFermesFinaux.Enabled = false;
lbOuvertsFinaux.Enabled = false;
treeViewFinal.Enabled = false;
foreach (string s in lOuverts)
{
this.listBoxRepOuverts.Items.Add(s);
}
foreach (string s in lFermes)
{
this.listBoxRepFermes.Items.Add(s);
}
for (int i = 0; i < this.listBoxRepFermes.Items.Count; i++)
{
if (this.lbFermesFinaux.Items.Count == this.listBoxRepFermes.Items.Count)
{
if (Convert.ToString(this.lbFermesFinaux.Items[i]) != Convert.ToString(this.listBoxRepFermes.Items[i]))
{
this.listBoxRepFermes.ForeColor = Color.Red;
}
else
{
this.listBoxRepFermes.ForeColor = Color.Green;
}
}
else
{
this.listBoxRepFermes.ForeColor = Color.Red;
}
}
for (int i = 0; i < this.listBoxRepOuverts.Items.Count; i++)
{
if (this.lbOuvertsFinaux.Items.Count == this.listBoxRepOuverts.Items.Count)
{
if (Convert.ToString(this.lbOuvertsFinaux.Items[i]) != Convert.ToString(this.listBoxRepOuverts.Items[i]))
{
this.listBoxRepOuverts.ForeColor = Color.Red;
}
else
{
this.listBoxRepOuverts.ForeColor = Color.Green;
}
}
else
{
this.listBoxRepOuverts.ForeColor = Color.Red;
}
}
}